465 search results - page 13 / 93 » On the Hardness of Range Assignment Problems |
SIGMETRICS
2008
ACM
14 years 9 months ago
2008
ACM
Network traffic modeling generally views traffic as a superposition of flows that creates a timeseries of volume counts (e.g. of bytes or packets). What is omitted from this view ...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
ALGOSENSORS
2007
Springer
15 years 3 months ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
187
click to vote
STOC
2012
ACM
12 years 12 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
We consider an agent-target assignment problem in an unknown environment modeled as an undirected graph. Agents do not know this graph or the locations of the targets on it. Howeve...