2430 search results - page 135 / 486 » Computing Tutte Polynomials |
115
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...
145
Voted
ATVA
2006
Springer
15 years 8 months ago
2006
Springer
Motivated by recent applications of pushdown systems to computer security problems, we present an efficient algorithm for the reachability problem of alternating pushdown systems. ...
157
click to vote
UAI
2004
15 years 6 months ago
2004
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
121
click to vote
FSTTCS
2008
Springer
15 years 6 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
139
Voted
ICCS
2005
Springer
15 years 10 months ago
2005
Springer
: In the reliability-risk assessment, the second order reliability index method and the Conditional Expectation Monte Carlo (CEMC) simulation were interrelated as a new Level III a...