2657 search results - page 246 / 532 » On the complexity of hierarchical problem solving |
157
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
130
click to vote
RTSS
2002
IEEE
15 years 10 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
157
click to vote
ICCVW
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. Popular algorithms for feature matching and model extraction fall into two broad categories, generate-and-test and Hough transform variations. However, both methods su er...
154
click to vote
ICCSA
2007
Springer
15 years 9 months ago
2007
Springer
Coupled systems comprise multiple interacting subsystems and are an increasingly common computational science application, most notably as multiscale and multiphysics models. Paral...
154
click to vote
EOR
2006
15 years 5 months ago
2006
In Gal and Hanne [Eur. J. Oper. Res. 119 (1999) 373] the problem of using several methods to solve a multiple criteria decision making (MCDM) problem with linear objective functio...