2657 search results - page 167 / 532 » On the complexity of hierarchical problem solving |
CORR
2007
Springer
15 years 1 months ago
2007
Springer
—In ad hoc networks scalability is a critical requirement if these technologies have to reach their full potential. Most of the proposed routing protocols do not operate efficien...
109
click to vote
CGF
1999
15 years 1 months ago
1999
This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly i...
122
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
In traditional framework of Compressive Sensing (CS), only sparse prior on the property of signals in time or frequency domain is adopted to guarantee the exact inverse recovery. ...
109
click to vote
CADE
2007
Springer
16 years 2 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
IANDC
1998
15 years 1 months ago
1998
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...