3874 search results - page 308 / 775 » Approximation Algorithms for k-hurdle Problems |
200
click to vote
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
141
click to vote
NICSO
2010
Springer
15 years 11 months ago
2010
Springer
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...
118
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
134
click to vote
FLAIRS
2003
15 years 6 months ago
2003
Researchers studying Evolutionary Algorithms and their applications have always been confronted with the sample complexity problem. The relationship between population size and gl...
128
click to vote
IJCAI
2003
15 years 6 months ago
2003
This paper introduces the Point-Based Value Iteration (PBVI) algorithm for POMDP planning. PBVI approximates an exact value iteration solution by selecting a small set of represen...