31 search results - page 6 / 7 » A Comparison of Algorithms for Multi-player Games |
183
Voted
ESA
2007
Springer
15 years 7 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
140
Voted
SOFSEM
2010
Springer
16 years 12 days ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
139
Voted
ALENEX
2009
15 years 4 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
125
Voted
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
High performance computing is critical for financial markets where analysts seek to accelerate complex optimizations such as pricing engines to maintain a competitive edge. In th...
125
click to vote
CAV
2009
Springer
16 years 4 months ago
2009
Springer
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...