Sciweavers

1884 search results - page 210 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
ICASSP
2010
IEEE
15 years 6 months ago
Sparse Bayesian step-filtering for high-throughput analysis of molecular machine dynamics
Nature has evolved many molecular machines such as kinesin, myosin, and the rotary flagellar motor powered by an ion current from the mitochondria. Direct observation of the step-...
Max A. Little, Nick S. Jones
AMAI
2008
Springer
15 years 6 months ago
The giving tree: constructing trees for efficient offline and online multi-robot coverage
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
Noa Agmon, Noam Hazon, Gal A. Kaminka
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 6 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
MOBICOM
2005
ACM
15 years 12 months ago
PeopleNet: engineering a wireless virtual social network
People often seek information by asking other people even when they have access to vast reservoirs of information such as the Internet and libraries. This is because people are gr...
Mehul Motani, Vikram Srinivasan, Pavan Nuggehalli
CISS
2008
IEEE
16 years 24 days ago
The Chinese Generals Problem
Abstract—To achieve higher reliability, safety, and faulttolerance, many mission-critical detection and decision systems implement consensus algorithms that force the systems’ ...
Edwin Soedarmadji