4843 search results - page 362 / 969 » The Shortcut Problem - Complexity and Approximation |
128
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
125
click to vote
DCOSS
2009
Springer
15 years 11 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
117
click to vote
CC
2007
Springer
15 years 10 months ago
2007
Springer
Optimizing programs for modern multiprocessor or vector platforms is a major important challenge for compilers today. In this work, we focus on one challenging aspect: the SIMD ALI...
163
click to vote
CORR
2012
Springer
14 years 5 days ago
2012
Springer
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
132
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...