4342 search results - page 380 / 869 » Improved Algorithms for Optimal Embeddings |
192
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
171
click to vote
EUROGP
2007
Springer
16 years 1 months ago
2007
Springer
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
173
click to vote
ESA
1998
Springer
15 years 11 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
226
click to vote
ICALP
1991
Springer
15 years 10 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
175
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...