2252 search results - page 136 / 451 » Lower Bounds for Dynamic Algorithms |
134
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
132
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
156
click to vote
CIAC
1994
Springer
15 years 7 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
164
click to vote
TMC
2010
14 years 10 months ago
2010
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
152
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We study a new gigapixel image sensor that is reminiscent of traditional photographic film. Each pixel in the sensor has a binary response, giving only a one-bit quantized measur...