2657 search results - page 247 / 532 » On the complexity of hierarchical problem solving |
183
click to vote
SOFSEM
2012
Springer
14 years 1 months ago
2012
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...
177
click to vote
DAGM
2007
Springer
16 years 11 days ago
2007
Springer
Abstract. We consider the problem of non-rigid, point-to-point registration of two 3D surfaces. To avoid restrictions on the topology, we represent the surfaces as a level-set of t...
152
click to vote
ICALP
1997
Springer
15 years 10 months ago
1997
Springer
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
160
click to vote
IPPS
1994
IEEE
15 years 10 months ago
1994
IEEE
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
180
click to vote
COR
2008
15 years 6 months ago
2008
Operations research and management science are often confronted with sequential decision making problems with large state spaces. Standard methods that are used for solving such c...