971 search results - page 120 / 195 » Planning with Reduced Operator Sets |
172
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
204
click to vote
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
145
click to vote
CPAIOR
2009
Springer
16 years 27 days ago
2009
Springer
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
138
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
182
click to vote
IJRR
2006
15 years 6 months ago
2006
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missio...