3946 search results - page 768 / 790 » The computational complexity of choice sets |
SYNASC
2006
IEEE
15 years 5 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
116
click to vote
DOCENG
2006
ACM
15 years 5 months ago
2006
ACM
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
104
click to vote
HRI
2006
ACM
15 years 5 months ago
2006
ACM
Programming robots to carry out useful tasks is both a complex and non-trivial exercise. A simple and intuitive method to allow humans to train and shape robot behaviour is clearl...
104
click to vote
ISSTA
2006
ACM
15 years 5 months ago
2006
ACM
The popularity of object-oriented programming has led to the wide use of container libraries. It is important for the reliability of these containers that they are tested adequate...
147
click to vote
SENSYS
2006
ACM
15 years 5 months ago
2006
ACM
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...