Sciweavers

1220 search results - page 31 / 244
» Minimal Interval Completions
Sort
View
AAIM
2009
Springer
98views Algorithms» more  AAIM 2009»
15 years 6 months ago
Latency Constrained Aggregation in Chain Networks Admits a PTAS
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
Tim Nonner, Alexander Souza
CNSR
2009
IEEE
108views Communications» more  CNSR 2009»
15 years 3 months ago
A New Adaptive Prediction-Based Tracking Scheme for Wireless Sensor Networks
The accuracy of the object tracking is dependent on the tracking time interval. Smaller tracking time interval increases the accuracy of tracking a moving object. However, this inc...
Hadi Jamali Rad, Bahman Abolhassani, Mohammad Abdi...
80
Voted
CORR
2006
Springer
74views Education» more  CORR 2006»
14 years 12 months ago
Scheduling Algorithms for Procrastinators
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...
Michael A. Bender, Raphaël Clifford, Kostas T...
ADHOCNOW
2009
Springer
15 years 28 days ago
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...
4OR
2005
71views more  4OR 2005»
14 years 11 months ago
On rank-perfect subclasses of near-bipartite graphs
Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...
Annegret Wagler