356 search results - page 38 / 72 » Graph Games on Ordinals |
106
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
142
click to vote
MP
2011
14 years 6 months ago
2011
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
CONCUR
2008
Springer
15 years 1 months ago
2008
Springer
We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., t...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
JCT
2010
14 years 10 months ago
2010
An Avoider-Enforcer game is played by two players, called Avoider and Enforcer, on a hypergraph F ⊆ 2X . The players claim previously unoccupied elements of the board X in turns...