6279 search results - page 1 / 1256 » Studies in Solution Sampling |
AAAI
2008
13 years 6 months ago
2008
We introduce novel algorithms for generating random solutions from a uniform distribution over the solutions of a boolean satisfiability problem. Our algorithms operate in two pha...
LION
2009
Springer
13 years 11 months ago
2009
Springer
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
INFORMATICALT
2011
12 years 11 months ago
2011
This paper presents a study of the Hurst index estimation in the case of fractional Ornstein–Uhlenbeck and geometric Brownian motion models. The performance of the estimators is ...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
DAGSTUHL
2007
13 years 6 months ago
2007
Abstract. Moving objects produce trajectories, which are stored in databases by means of finite samples of time-stamped locations. When also speed limitations in these sample poin...