Sciweavers

2150 search results - page 245 / 430
» On a restricted cross-intersection problem
Sort
View
AAAI
2000
15 years 5 months ago
What Sensing Tells Us: Towards a Formal Theory of Testing for Dynamical Systems
Just as actions can have indirect effects on the state of the world, so too can sensing actions have indirect effects on an agent's state of knowledge. In this paper, we inve...
Sheila A. McIlraith, Richard B. Scherl
AAAI
2000
15 years 5 months ago
Asynchronous Search with Aggregations
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
NIPS
2000
15 years 5 months ago
Feature Correspondence: A Markov Chain Monte Carlo Approach
When trying to recover 3D structure from a set of images, the most di cult problem is establishing the correspondence between the measurements. Most existing approaches assume tha...
Frank Dellaert, Steven M. Seitz, Sebastian Thrun, ...
IJCAI
1997
15 years 5 months ago
Recursive Plans for Information Gathering
Generating query-answering plans for information gathering agents requires to translate a user query, formulated in terms of a set of virtual relations, to a query that uses relat...
Oliver M. Duschka, Alon Y. Levy
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 5 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler