Sciweavers

2485 search results - page 98 / 497
» Time Bounded Frequency Computations
Sort
View
ICRA
2006
IEEE
123views Robotics» more  ICRA 2006»
15 years 10 months ago
Bounding Uncertainty in EKF-SLAM: the Robocentric Local Approach
— This paper addresses the consistency issue of the Extended Kalman Filter approach to the simultaneous localization and mapping (EKF-SLAM) problem. Linearization of the inherent...
Ruben Martinez-Cantin, José A. Castellanos
ACTA
2007
92views more  ACTA 2007»
15 years 4 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
139
Voted
IPSN
2005
Springer
15 years 10 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
155
Voted
LICS
2009
IEEE
15 years 11 months ago
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
Oliver Friedmann
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
15 years 4 months ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni