65 search results - page 4 / 13 » Generating Counter-Examples Through Randomized Guided Search |
CP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Multi-Point Constructive Search maintains a small set of “elite solutions” that are used to heuristically guide constructive search through periodically restarting se...
CP
2006
Springer
14 years 1 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
EMO
2005
Springer
14 years 3 months ago
2005
Springer
Nearly all Multi-Objective Evolutionary Algorithms (MOEA) rely on random generation of initial population. In large and complex search spaces, this random method often leads to an ...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
In this paper, the task of selecting the optimal subset of pronunciation variants from a set of automatically generated candidates is recast as a tree search problem. In this appr...