661 search results - page 93 / 133 » Local Approximation Algorithms for Scheduling Problems in Se... |
135
click to vote
ICDCIT
2007
Springer
15 years 8 months ago
2007
Springer
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
124
click to vote
ALGOSENSORS
2008
Springer
15 years 4 months ago
2008
Springer
We consider the problem of uniformly dispersing mobile robotic sensors in a simply connected orthogonal space of unknown shape. The mobile sensors are injected into the space from ...
117
Voted
ICRA
2007
IEEE
15 years 8 months ago
2007
IEEE
— We consider the problem of multiple mobile sensor agents tracking the position of one or more moving targets. In our formulation, each agent maintains a target estimate, and ea...
114
click to vote
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
145
click to vote
HPDC
2002
IEEE
15 years 7 months ago
2002
IEEE
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...