9 search results - page 1 / 2 » On Iterated Dominance, Matrix Elimination, and Matched Paths |
STACS
2010
Springer
13 years 11 months ago
2010
Springer
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
DATE
2003
IEEE
13 years 10 months ago
2003
IEEE
While fast timing analysis methods, such as asymptotic waveform evaluation (AWE), have been well established for linear circuits, the timing analysis for non-linear circuits, whic...
ICIP
1994
IEEE
14 years 6 months ago
1994
IEEE
It has been shown that the computation time of Document Image Decoding can be significantly reduced by employing heuristics in the search for the best decoding of a text line. In ...
MMAS
2011
Springer
12 years 7 months ago
2011
Springer
This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow th...