740 search results - page 72 / 148 » Lower bounds for Buchsbaum* complexes |
158
click to vote
AAAI
1997
15 years 7 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
140
click to vote
ATAL
2007
Springer
16 years 10 days ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
167
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tol...
152
click to vote
TSP
2008
15 years 6 months ago
2008
Abstract-- We consider approximations of signals by the elements of a frame in a complex vector space of dimension N and formulate both the noiseless and the noisy sparse represent...
157
click to vote
SPIRE
2010
Springer
15 years 4 months ago
2010
Springer
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...