Sciweavers

536 search results - page 89 / 108
» Some Lower Bounds for the Complexity of Continuation Methods
Sort
View
ICDE
2008
IEEE
563views Database» more  ICDE 2008»
15 years 8 months ago
Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data
In applications like location-based services, sensor monitoring and biological databases, the values of the database items are inherently uncertain in nature. An important query fo...
Reynold Cheng, Jinchuan Chen, Mohamed F. Mokbel, C...
FOCS
1993
IEEE
14 years 17 days ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani
CDC
2010
IEEE
107views Control Systems» more  CDC 2010»
13 years 3 months ago
Probabilistic mutual localization in multi-agent systems from anonymous position measures
Abstract-- Recent research on multi-agent systems has produced a plethora of decentralized controllers that implicitly assume various degrees of agent localization. However, many p...
Antonio Franchi, Giuseppe Oriolo, Paolo Stegagno
CAV
2009
Springer
209views Hardware» more  CAV 2009»
14 years 9 months ago
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamari...
HT
2003
ACM
14 years 1 months ago
Do adaptation rules improve web cost estimation?
Analogy-based estimation has, over the last 15 years, and particularly over the last 7 years, emerged as a promising approach with comparable accuracy to, or better than, algorith...
Emilia Mendes, Nile Mosley, Steve Counsell