1523 search results - page 4 / 305 » Partially ordered secretaries |
MLQ
2007
13 years 10 months ago
2007
Let R be the preorder of embeddability between countable linear orders colored with elements of Rado’s partial order (a standard example of a wqo which is not a bqo). We show tha...
AAAI
1993
14 years 5 days ago
1993
This paper provides a systematic analysisof the relativeutility of basingEBG based plan reuse techniques in partial ordering vs. total ordering planning frameworks. We separate th...
DAM
2008
13 years 11 months ago
2008
This paper presents the axioms of a real time random walk on the set of states of a medium and some of their consequences, such as the asymptotic probabilities of the states. The ...
IJCAI
1989
14 years 15 hour 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,...
IJCAI
2001
14 years 7 days ago
2001
One of the more controversial recent planning algorithms is the SHOP algorithm, an HTN planning algorithm that plans for tasks in the same order that they are to be executed. SHOP...