457 search results - page 25 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
224
click to vote
SPAA
1993
ACM
15 years 10 months ago
1993
ACM
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
153
click to vote
CAV
2007
Springer
16 years 7 days ago
2007
Springer
ng-Lens Abstraction for Markov Decision Processes⋆ In Proc. of CAV 2007: 19th International Conference on Computer-Aided Verification, Lectures Notes in Computer Science. c Spri...
117
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...
153
click to vote
CCA
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
151
click to vote
PODC
2003
ACM
15 years 11 months ago
2003
ACM
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...