Sciweavers

128 search results - page 6 / 26
» The Need for Different Domain-independent Heuristics
Sort
View
GECCO
2003
Springer
15 years 3 months ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene
ICCAD
2001
IEEE
192views Hardware» more  ICCAD 2001»
15 years 6 months ago
BOOM - A Heuristic Boolean Minimizer
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
Jan Hlavicka, Petr Fiser
IJSWIS
2006
83views more  IJSWIS 2006»
14 years 9 months ago
Semantic Enrichment in Ontologies for Matching
Ontology matching (or mapping)--finding correspondences between semantically related entities of heterogeneous ontologies--becomes crucial for interoperability in distributed and ...
Nwe Ni Tun, Satoshi Tojo
IJCAI
2007
14 years 11 months ago
Transferring Learned Control-Knowledge between Planners
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently guide the problem-space exploration. Machine learning (ML) provides several tec...
Susana Fernández, Ricardo Aler, Daniel Borr...
HEURISTICS
2002
146views more  HEURISTICS 2002»
14 years 9 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...