Sciweavers

102 search results - page 15 / 21
» A reading algorithm for constraint diagrams
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 8 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
DAC
2004
ACM
14 years 8 months ago
Modular scheduling of guarded atomic actions
A modular synthesis flow is essential for a scalable and hierarchical design methodology. This paper considers a particular modular flow where each module has interface methods an...
Daniel L. Rosenband, Arvind
MASS
2010
13 years 5 months ago
You can't get there from here: Sensor scheduling with refocusing delays
We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the o...
Yosef Alayev, Amotz Bar-Noy, Matthew P. Johnson, L...
ICDE
2006
IEEE
186views Database» more  ICDE 2006»
14 years 9 months ago
Energy-Efficient Continuous Isoline Queries in Sensor Networks
Environmental monitoring is a promising application for sensor networks. Many scenarios produce geographically correlated readings, making them visually interesting and good targe...
Adam Silberstein, Jun Yang 0001, Rebecca Braynard
IROS
2007
IEEE
119views Robotics» more  IROS 2007»
14 years 2 months ago
Self-localization of a heterogeneous multi-robot team in constrained 3D space
Abstract— This paper presents a new approach to the intralocalization among a team of robots working in constrained 3D space of urban environments. As the base formation, a team ...
Yi Feng 0002, Zhigang Zhu, Jizhong Xiao