543 search results - page 76 / 109 » A Randomized Parallel Sorting Algorithm with an Experimental... |
110
Voted
CPAIOR
2006
Springer
15 years 5 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
138
click to vote
DEBS
2009
ACM
15 years 6 months ago
2009
ACM
One of the main challenges faced by content-based publish/subscribe systems is handling large amount of dynamic subscriptions and publications in a multidimensional content space....
211
Voted
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
124
click to vote
DMIN
2008
15 years 3 months ago
2008
Abstract - The rapid advances of wireless and web technologies enable the mobile users to request various kinds of services via mobile devices at anytime and anywhere. To provide t...
98
Voted
CLUSTER
2008
IEEE
15 years 8 months ago
2008
IEEE
— Applications raising in many scientific fields exhibit both data and task parallelism that have to be exploited efficiently. A classic approach is to structure those applica...