655 search results - page 75 / 131 » Evolving Heuristics for Planning |
ICTAI
2003
IEEE
15 years 5 months ago
2003
IEEE
Planning for numeric goals is an important problem. Only one of the many participants from the 2002 international planning competition (Metric-FF) can effectively handle problems ...
102
click to vote
CP
1998
Springer
15 years 4 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
139
click to vote
ASE
1998
14 years 11 months ago
1998
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
107
click to vote
AIPS
2008
15 years 2 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
122
click to vote
EDBT
2012
ACM
13 years 2 months ago
2012
ACM
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...