531 search results - page 48 / 107 » A Better Algorithm for Random k-SAT |
157
click to vote
ISCAS
2005
IEEE
15 years 11 months ago
2005
IEEE
— A computation-aware motion estimation algorithm is proposed in this paper. Its goal is to find the best block matching results in a computation-limited and computation-variant...
145
click to vote
ICML
2009
IEEE
16 years 6 months ago
2009
IEEE
In this paper we introduce the first algorithms for efficiently learning a simulation policy for Monte-Carlo search. Our main idea is to optimise the balance of a simulation polic...
160
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
131
click to vote
GECCO
2000
Springer
15 years 9 months ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
200
click to vote
IEEESCC
2009
IEEE
15 years 3 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...