520 search results - page 36 / 104 » New Complexity Results for Classical Planning Benchmarks |
RECOMB
2002
Springer
14 years 8 months ago
2002
Springer
A recent idea for determining the three-dimensional structure of a protein uses antibody recognition of surface structure and random peptide libraries to map antibody epitope comb...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—We propose to use multiscale entropy analysis in characterisation of network traffic and spectrum usage. We show that with such analysis one can quantify complexity and predict...
SYNASC
2006
IEEE
14 years 2 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
ISBRA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. DNA microarrays can monitor the expression levels of thousands of genes simultaneously, providing the opportunity for the identification of genes that are differentiall...
IJRR
2011
13 years 3 months ago
2011
Abstract Partially observable Markov decision processes (POMDPs) are a principled mathematical framework for planning under uncertainty, a crucial capability for reliable operation...