Sciweavers

1486 search results - page 209 / 298
» Algorithms for two-box covering
Sort
View
MOBICOM
2005
ACM
15 years 10 months ago
Barrier coverage with wireless sensors
In old times, castles were surrounded by moats (deep trenches filled with water, and even alligators) to thwart or discourage intrusion attempts. One can now replace such barrier...
Santosh Kumar, Ten-Hwang Lai, Anish Arora
ISSTA
2004
ACM
15 years 10 months ago
Optimal strategies for testing nondeterministic systems
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
Lev Nachmanson, Margus Veanes, Wolfram Schulte, Ni...
EENERGY
2010
15 years 8 months ago
Towards energy-aware scheduling in data centers using machine learning
As energy-related costs have become a major economical factor for IT infrastructures and data-centers, companies and the research community are being challenged to find better an...
Josep Lluis Berral, Iñigo Goiri, Ramon Nou,...
ICDCS
2010
IEEE
15 years 6 months ago
Minimizing Probing Cost and Achieving Identifiability in Network Link Monitoring
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
Qiang Zheng, Guohong Cao
155
Voted
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
15 years 6 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...