Sciweavers

2657 search results - page 67 / 532
» On the complexity of hierarchical problem solving
Sort
View
AUSAI
2004
Springer
15 years 6 months ago
A Comparison of BDI Based Real-Time Reasoning and HTN Based Planning
The Belief-Desire-Intention (BDI) model of agency is an architecture based on Bratman’s theory of practical reasoning. Hierarchical Task Network (HTN) decomposition on the other ...
Lavindra de Silva, Lin Padgham
AI
2005
Springer
15 years 1 months ago
: Compiling problem specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
Marco Cadoli, Andrea Schaerf
SIAMNUM
2011
139views more  SIAMNUM 2011»
14 years 8 months ago
Adaptive Wavelet Schemes for Parabolic Problems: Sparse Matrices and Numerical Results
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
Nabi Chegini, Rob Stevenson
ORL
2006
118views more  ORL 2006»
15 years 1 months ago
On complexity of multistage stochastic programs
In this paper we derive estimates of the sample sizes required to solve a multistage stochastic programming problem with a given accuracy by the (conditional sampling) sample aver...
Alexander Shapiro
TAMC
2009
Springer
15 years 8 months ago
On Parameterized Exponential Time Complexity
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
Jianer Chen, Iyad A. Kanj, Ge Xia