- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
: In this paper we propose a Grid Workflow Infrastructure, which serves as the base for specifying and executing collaborative interactive workflows within computational grids. The...
In this paper we propose a Grid Workflow Infrastructure, which serves as the base for specifying and executing collaborative interactive workflows within computational grids. The ...
-- In the past decade there has been spectacular growth in the number and size of third-party libraries, frameworks, toolkits and other Application Programming Interfaces (APIs) av...
Daniel S. Eisenberg, Jeffrey Stylos, Andrew Faulri...
Abstract. Regarding web searches, users have become used to keywordbased search interfaces due to their ease of use. However, this implies a semantic gap between the user's in...
Carlos Bobed, Raquel Trillo, Eduardo Mena, Sergio ...