727 search results - page 16 / 146 » Private approximation of search problems |
AIPS
2008
14 years 1 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
STOC
1998
ACM
14 years 3 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
GECCO
2010
Springer
14 years 8 hour ago
2010
Springer
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
ATAL
2008
Springer
14 years 28 days ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
CPC
2008
13 years 11 months ago
2008
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...