3874 search results - page 387 / 775 » Approximation Algorithms for k-hurdle Problems |
195
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
201
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
160
Voted
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
194
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
163
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...