482 search results - page 20 / 97 » On the Size of Reactive Plans |
ICSE
2007
IEEE-ACM
14 years 8 months ago
2007
IEEE-ACM
Large networks, such as the Internet, pose an ideal medium for solving computationally intensive problems, such as NP-complete problems, yet no well-scaling architecture for Inter...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
A significant challenge in developing planning systems for practical applications is the difficulty of acquiring the domain knowledge needed by such systems. One method for acquir...
AIPS
2008
13 years 10 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
AIPS
2003
13 years 9 months ago
2003
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
BMCBI
2010
13 years 8 months ago
2010
Background: Determining a suitable sample size is an important step in the planning of microarray experiments. Increasing the number of arrays gives more statistical power, but ad...