9119 search results - page 355 / 1824 » A Simultaneous Search Problem |
139
click to vote
UC
2005
Springer
16 years 6 days ago
2005
Springer
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
150
click to vote
COMPGEOM
2004
ACM
16 years 5 days ago
2004
ACM
We discuss online strategies for visibility-based searching for an object hidden behind a corner, using Kurt3D, a real autonomous mobile robot. This task is closely related to a n...
165
click to vote
CP
2004
Springer
16 years 4 days ago
2004
Springer
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
177
click to vote
ESA
1999
Springer
15 years 11 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
157
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...