13603 search results - page 7 / 2721 » On the Computational Complexity of Cut-Reduction |
CSCWD
2008
Springer
13 years 9 months ago
2008
Springer
Design is a complex process often described as a collaboration between a designer and herself. In architectural design, a designer must consider the selection of a subset of actio...
CORR
1998
Springer
13 years 7 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
COMGEO
2010
ACM
13 years 7 months ago
2010
ACM
We study the complexity and the I/O-efficient computation of flow on triangulated terrains. We present an acyclic graph, the descent graph, that enables us to trace flow paths in ...
IJCAI
2001
13 years 8 months ago
2001
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
CATS
2007
13 years 8 months ago
2007
A model for the problem of predicting the outputs of a process, based only on knowledge of previous outputs, is proposed in terms of a decision problem. The strength of this parti...