Sciweavers

1300 search results - page 204 / 260
» Probabilistic logic with independence
Sort
View
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
13 years 7 months ago
A Note on the Expected Time for Finding Maxima by List Algorithms
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
Luc Devroye
RAS
2002
247views more  RAS 2002»
13 years 7 months ago
Reference scan matching for global self-localization
Especially in dynamic environments a key feature concerning the robustness of mobile robot navigation is the capability of global self-localization. This term denotes a robot'...
Joachim Weber, Lutz Franken, Klaus-Werner Jör...
ICRA
2010
IEEE
119views Robotics» more  ICRA 2010»
13 years 6 months ago
Recognition of situation classes at road intersections
— The recognition and prediction of situations is an indispensable skill of future driver assistance systems. This study focuses on the recognition of situations involving two ve...
Eugen Kafer, Christoph Hermes, Christian Wöhl...
INFFUS
2010
121views more  INFFUS 2010»
13 years 6 months ago
The statistical mechanics of belief sharing in multi-agent systems
- Many exciting, emerging applications require that a group of agents share a coherent view of the world given spatial distribution, incomplete and uncertain sensors, and communica...
Robin Glinton, Katia P. Sycara, David Scerri, Paul...
TPDS
2010
142views more  TPDS 2010»
13 years 6 months ago
Toward Optimal Network Fault Correction in Externally Managed Overlay Networks
—We consider an end-to-end approach of inferring probabilistic data-forwarding failures in an externally managed overlay network, where overlay nodes are independently operated b...
Patrick P. C. Lee, Vishal Misra, Dan Rubenstein