703 search results - page 50 / 141 » Using Cases Utility for Heuristic Planning Improvement |
WEA
2010
Springer
14 years 25 days ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
This paper considers the design of agent strategies for deciding whether to help other members of a group with whom an agent is engaged in a collaborative activity. Three characte...
AIPS
2008
13 years 10 months ago
2008
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we will describe some heuristics that can be used to improve the runtime of a wide range of commonly used algorithms for the negative cycle detection problem signiï¬...
KDD
1995
ACM
13 years 11 months ago
1995
ACM
In the wrapperapproachto feature subset selection, a searchfor an optimalset of features is madeusingthe induction algorithm as a black box. Theestimated future performanceof the ...