22 search results - page 2 / 5 » A Faster Counterexample Minimization Algorithm Based on Refu... |
AAAI
2012
11 years 7 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
ASPDAC
2009
ACM
13 years 12 months ago
2009
ACM
– With the popularity of Multiple Power Domain (MPD) design, the multi-domain power network noise analysis and minimization is becoming important. This paper describes an efficie...
ASPDAC
2004
ACM
13 years 10 months ago
2004
ACM
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
ESOP
2007
Springer
13 years 11 months ago
2007
Springer
We give a new practical algorithm to compute, in finite time, a fixpoint (and often the least fixpoint) of a system of equations in the abstract numerical domains of zones and t...
TC
2011
12 years 11 months ago
2011
—Single and double scalar multiplications are the most computational intensive operations in elliptic curve based cryptosystems. Improving the performance of these operations is ...