5 citations · 21 across the 11 of their papers we have counts for
11 papers
An Efficient Algorithm for Computing Mountain Prominence in Almost Linear Time
George Alex Dumitrescu, Paul Flavian Diac
Prominence is one of the most important measurements in topography and mountaineering. This paper describes an efficient, almost linear time algorithm for computing mountain promin…
An Introductory Study on the Power Consumption Overhead of ERC-4337 Bundlers
Andrei Arusoaie, Claudiu-Nicu Bărbieru, Oana-Otilia Captarencu +3
Ethereum is currently the main blockchain ecosystem providing decentralised trust guarantees for applications ranging from finance to e-government. A common criticism of blockchain…
PACE Solver Description: A Heuristic Directed Feedback Vertex Set Problem Algorithm
Andrei Arhire, Paul Diac
A feedback vertex set of a graph is a set of nodes with the property that every cycle contains at least one vertex from the set i.e. the removal of all vertices from a feedback ver…
Automatic Web Service Composition -- Models, Complexity and Applications
Paul Diac
The automatic composition of web services refers to how services can be used in a complex and aggregate manner, to serve a specific and known functionality. Given a list of service…
Relational Model for Parameter Description in Automatic Semantic Web Service Composition
Paul Diac, Liana Ţucăr, Andrei Netedu
Automatic Service Composition is a research direction aimed at facilitating the usage of atomic web services. Particularly, the goal is to build workflows of services that solve sp…
A Web Service Composition Method Based on OpenAPI Semantic Annotations
Andrei Netedu, Sabin C. Buraga, Paul Diac +1
Automatic Web service composition is a research direction aimed to improve the process of aggregating multiple Web services to create some new, specific functionality. The use of s…
Vehicle Routing and Scheduling for Regular Mobile Healthcare Services
Cosmin Pascaru, Paul Diac
We propose our solution to a particular practical problem in the domain of vehicle routing and scheduling. The generic task is finding the best allocation of the minimum number of…
Extending the Service Composition Formalism with Relational Parameters
Paul Diac, Liana Tucar, Radu Mereuta
Web Service Composition deals with the (re)use of Web Services to provide complex functionality, inexistent in any single service. Over the state-of-the-art, we introduce a new typ…
Predicting Destinations by Nearest Neighbor Search on Training Vessel Routes
Valentin Roşca, Emanuel Onica, Paul Diac +1
The DEBS Grand Challenge 2018 is set in the context of maritime route prediction. Vessel routes are modeled as streams of Automatic Identification System (AIS) data points selected…
Cell Grid Architecture for Maritime Route Prediction on AIS Data Streams
Ciprian Amariei, Paul Diac, Emanuel Onica +1
The 2018 Grand Challenge targets the problem of accurate predictions on data streams produced by automatic identification system (AIS) equipment, describing naval traffic. This pap…
Grand Challenge: Optimized Stage Processing for Anomaly Detection on Numerical Data Streams
Ciprian Amariei, Paul Diac, Emanuel Onica
The 2017 Grand Challenge focused on the problem of automatic detection of anomalies for manufacturing equipment. This paper reports the technical details of a solution focused on p…