457 search results - page 19 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
132
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
140
click to vote
TIT
2008
15 years 6 months ago
2008
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
166
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
156
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 ...
166
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...