4198 search results - page 299 / 840 » In search of lost time |
169
click to vote
AAAI
2007
15 years 9 months ago
2007
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the probl...
184
click to vote
EOR
2008
15 years 6 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
157
click to vote
JFP
2006
15 years 6 months ago
2006
We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized constant time, and concatenation and splitting in tim...
164
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
207
click to vote
AFRICACRYPT
2010
Springer
16 years 1 months ago
2010
Springer
In this paper we present an algorithm for parallel exhaustive search for short vectors in lattices. This algorithm can be applied to a wide range of parallel computing systems. To ...