3874 search results - page 242 / 775 » Approximation Algorithms for k-hurdle Problems |
163
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
XCS with computed prediction, namely XCSF, has been recently extended in several ways. In particular, a novel prediction update algorithm based on recursive least squares and the ...
173
click to vote
SSDBM
2003
IEEE
15 years 11 months ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
150
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
166
click to vote
CCCG
2007
15 years 8 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
174
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...