506 search results - page 2 / 102 » Automated Search for Heuristic Functions |
AIPS
2008
13 years 7 months ago
2008
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
ICCD
2001
IEEE
14 years 2 months ago
2001
IEEE
Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. ...
KR
2004
Springer
13 years 10 months ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
SOCO
2005
Springer
13 years 10 months ago
2005
Springer
In an open environment populated by large numbers of services, automated service composition is a major challenge. In such a setting the efficient interaction of directory-based s...
LION
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we introduce the variable fitness function which can be used to control the search direction of any search based optimisation heuristic where more than one objective ...