Sciweavers

3192 search results - page 81 / 639
» The minimum latency problem
Sort
View
EOR
2006
65views more  EOR 2006»
14 years 10 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini
IJRR
2007
60views more  IJRR 2007»
14 years 10 months ago
Randomized Algorithms for Minimum Distance Localization
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
Malvika Rao, Gregory Dudek, Sue Whitesides
TCS
2011
14 years 5 months ago
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...
Pinar Heggernes, Daniel Meister, Andrzej Proskurow...
ESA
2007
Springer
93views Algorithms» more  ESA 2007»
15 years 4 months ago
Polynomial Time Algorithms for Minimum Energy Scheduling
The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for savin...
Philippe Baptiste, Marek Chrobak, Christoph Dü...
INFOCOM
2005
IEEE
15 years 3 months ago
A calculus approach to minimum energy transmission policies with quality of service guarantees
— We consider a queueing system with controllable service rate; for example, a transmitter whose rate can be controlled by varying the transmission power. For such a system we ob...
Murtaza Zafer, Eytan Modiano