Sciweavers

247 search results - page 36 / 50
» Perspectives in Probabilistic Verification
Sort
View
ECAI
2006
Springer
14 years 1 months ago
Situation Assessment for Sensor-Based Recovery Planning
We present an approach for recovery from perceptual failures, or more precisely anchoring failures. Anchoring is the problem of connecting symbols representing objects to sensor da...
Abdelbaki Bouguerra, Lars Karlsson, Alessandro Saf...
AAAI
2004
13 years 11 months ago
Towards Efficient Sampling: Exploiting Random Walk Strategies
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
Wei Wei, Jordan Erenrich, Bart Selman
COMBINATORICS
2004
112views more  COMBINATORICS 2004»
13 years 9 months ago
Airy Phenomena and Analytic Combinatorics of Connected Graphs
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
Philippe Flajolet, Bruno Salvy, Gilles Schaeffer
DKE
2002
94views more  DKE 2002»
13 years 9 months ago
Tie-breaking strategies for fast distance join processing
The distance join is a spatial join that finds pairs of closest objects in the order of distance by associating two spatial data sets. The distance join stores node pairs in a pri...
Hyoseop Shin, Bongki Moon, Sukho Lee
JACM
2002
122views more  JACM 2002»
13 years 9 months ago
Cosmological lower bound on the circuit complexity of a small problem in logic
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
Larry J. Stockmeyer, Albert R. Meyer