9119 search results - page 1479 / 1824 » A Simultaneous Search Problem |
120
click to vote
AIPS
2000
15 years 5 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
141
Voted
DELOS
2000
15 years 5 months ago
2000
We present the Private Digital Library (PDL) project that represents a service of the Corporate Digital Library (CDL) prototype. The main ideas underlying this project are the foll...
155
Voted
UAI
2000
15 years 5 months ago
2000
Decision theory does not traditionally include uncertainty over utility functions. We argue that the a person's utility value for a given outcome can be treated as we treat o...
145
Voted
ISMB
1994
15 years 5 months ago
1994
Wepresent algorithms for kinematic manipulation of molecular chains subject to fixed bond lengths and bond angles. They are useful for calculating conformations of a molecule subj...
155
Voted
AIPS
2009
15 years 5 months ago
2009
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...