1639 search results - page 177 / 328 » Anytime Heuristic Search |
AIPS
2000
13 years 10 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
IJCAI
1989
13 years 10 months ago
1989
Partially ordered plans have not solved the goal ordering problem. Consider: a goal in a par tially ordered plan is an operator precondition that is not yet achieved; operators,...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
SCHEDULING
2008
13 years 8 months ago
2008
We propose a new approach for scheduling with strict deadlines and apply this approach to the TimeConstrained Project Scheduling Problem (TCPSP). To be able to meet these deadlines...
ISLPED
2010
ACM
13 years 7 months ago
2010
ACM
In this paper, a novel thermal-aware dynamic placement planner for reconfigurable systems is presented, which targets transient temperature reduction. Rather than solving time-...