1046 search results - page 62 / 210 » Approximation Algorithms for Domination Search |
135
click to vote
GECCO
2008
Springer
15 years 1 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...
104
Voted
SIGIR
2006
ACM
15 years 6 months ago
2006
ACM
Traditional web link-based ranking schemes use a single score to measure a page’s authority without concern of the community from which that authority is derived. As a result, a...
113
Voted
EC
2002
15 years 8 days ago
2002
Over the past few years, the research on evolutionary algorithms has demonstrated their niche in solving multiobjective optimization problems, where the goal is to nd a number of ...
113
click to vote
ESA
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
105
Voted
AAAI
2010
15 years 1 months ago
2010
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...