1092 search results - page 84 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
182
click to vote
SPIN
2010
Springer
15 years 4 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 ...
169
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representatio...
162
click to vote
CN
1998
15 years 5 months ago
1998
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
170
click to vote
IPPS
1997
IEEE
15 years 9 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
157
click to vote
DATE
2007
IEEE
16 years 9 days ago
2007
IEEE
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...