304 search results - page 29 / 61 » Dynamic ordered sets with exponential search trees |
139
click to vote
AIPS
1996
15 years 8 months ago
1996
The principle of least commitment was embraced early in planning research. Hierarchical task networks (HTNs)reason about high-level tasks without committing to specific low-level ...
162
click to vote
TOG
2008
15 years 6 months ago
2008
We present an algorithm for constructing kd-trees on GPUs. This algorithm achieves real-time performance by exploiting the GPU's streaming architecture at all stages of kd-tr...
162
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper sketches the design, and presents a scalability analysis and evaluation of NLS, a scalable naming and location service. NLS resolves textual names to the nearest of a s...
187
click to vote
WISEC
2010
ACM
15 years 4 months ago
2010
ACM
Despite increasing popularity, Location-based Services (LBS) (e.g., searching nearby points-of-interest on map) on mobile handheld devices have been subject to major privacy conce...
201
click to vote
CSCLP
2006
Springer
15 years 10 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...