42 search results - page 4 / 9 » Programmed Search in a Timetabling Problem over Finite Domai... |
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Action description languages, such as A and B [6], are expressive instruments introduced for formalizing planning domains and problems. The paper starts by proposing a me...
CP
2005
Springer
14 years 27 days ago
2005
Springer
Many problems used in AI planning including Blocks, Logistics, Gripper, Satellite, and others lack the interactions that characterize puzzles and can be solved nonoptimally in low...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...
COLING
2002
13 years 7 months ago
2002
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
I present MOSES (meta-optimizing semantic evolutionary search), a new probabilistic modeling (estimation of distribution) approach to program evolution. Distributions are not esti...