91 search results - page 4 / 19 » Information-theoretic approaches to branching in search |
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
A well-designed fitness function is essential to the effectiveness and efficiency of evolutionary testing. Fitness function design has been researched extensively. For fitness ...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
AI
2002
Springer
13 years 8 months ago
2002
Springer
Hex is a beautiful game with simple rules and a strategic complexity comparable to that of Chess and Go. The massive game-tree search techniques developed mostly for Chess and suc...
ICMLA
2007
13 years 10 months ago
2007
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
JSS
2010
13 years 7 months ago
2010
Automated test data generation has remained a topic of considerable interest for several decades because it lies at the heart of attempts to automate the process of Software Testi...