Sciweavers

1486 search results - page 163 / 298
» Algorithms for two-box covering
Sort
View
PODC
2005
ACM
15 years 10 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
16 years 5 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...
TACAS
2001
Springer
125views Algorithms» more  TACAS 2001»
15 years 8 months ago
Coverage Metrics for Temporal Logic Model Checking
In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proven to be correct, there is still a question of how complet...
Hana Chockler, Orna Kupferman, Moshe Y. Vardi
EUROPAR
2009
Springer
15 years 8 months ago
Optimal and Near-Optimal Energy-Efficient Broadcasting in Wireless Networks
Abstract. In this paper we propose an energy-efficient broadcast algorithm for wireless networks for the case where the transmission powers of the nodes are fixed. Our algorithm is...
Christos A. Papageorgiou, Panagiotis C. Kokkinos, ...
AAAI
1994
15 years 5 months ago
Just-In-Case Scheduling
This paper presents an algorithm, called JustIn-Case Scheduling, for building robust schedules that tend not to break. The algorithm implements the common sense idea of being prep...
Mark Drummond, John L. Bresina, Keith Swanson