Sciweavers

1614 search results - page 62 / 323
» Breadth-First Heuristic Search
Sort
View
TIT
1998
79views more  TIT 1998»
14 years 11 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård
CEC
2011
IEEE
13 years 11 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
JAIR
2011
134views more  JAIR 2011»
14 years 6 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
CIDM
2007
IEEE
15 years 6 months ago
K2GA: Heuristically Guided Evolution of Bayesian Network Structures from Data
— We present K2GA, an algorithm for learning Bayesian network structures from data. K2GA uses a genetic algorithm to perform stochastic search, while employing a modified versio...
Eli Faulkner
EH
2003
IEEE
127views Hardware» more  EH 2003»
15 years 5 months ago
Comparing Different Serial and Parallel Heuristics to Design Combinational Logic Circuits
In this paper, we perform a comparative study of different heuristics used to design combinational logic circuits. The use of local search hybridized with a genetic algorithm and ...
Carlos A. Coello Coello, Enrique Alba, Gabriel Luq...