2446 search results - page 167 / 490 » Choiceless Polynomial Time |
126
click to vote
STOC
1998
ACM
15 years 8 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
146
click to vote
ENTCS
2006
15 years 4 months ago
2006
In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the pro...
155
click to vote
TCS
2010
14 years 11 months ago
2010
We study a resource allocation problem where jobs have the following characteristics: Each job consumes some quantity of a bounded resource during a certain time interval and indu...
130
click to vote
CAISE
2008
Springer
15 years 6 months ago
2008
Springer
Web service business protocols are of importance to both clients and providers, as they model the external behaviour of services. However, the business protocol is not always publ...
155
click to vote
SPIN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...