1897 search results - page 116 / 380 » Conditional Linear Planning |
165
click to vote
AGENTS
1998
Springer
15 years 8 months ago
1998
Springer
Physical domains are notoriously hard to model completely and correctly, especially to capture the dynamics of the environment. Moreover, since environments change, it is even mor...
124
click to vote
AIPS
2009
15 years 5 months ago
2009
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
144
click to vote
AIPS
2009
15 years 5 months ago
2009
Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a se...
114
click to vote
ASIAN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We give conditions for hash table probing which minimize the expected number of collisions. A probing algorithm is determined by a sequence of numbers denoting jumps for ...
127
click to vote
BIRTHDAY
2003
Springer
15 years 9 months ago
2003
Springer
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs...