627 search results - page 11 / 126 » Efficient On-the-Fly Algorithms for the Analysis of Timed Ga... |
SIGECOM
2010
ACM
13 years 7 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
GLVLSI
2009
IEEE
13 years 10 months ago
2009
IEEE
A methodology is proposed to efficiently estimate the substrate noise generated by large scale aggressor circuits. Small spatial voltage differences within the ground distribution...
MVA
1990
13 years 7 months ago
1990
Multiresolution pyramid techniques can improve the efficiency of basic vision algorithms by orders of magnitude. They will be key to developing practical vision systems to perform...
CG
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
SIGECOM
2011
ACM
12 years 9 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...