1599 search results - page 200 / 320 » Algorithms for Parity Games |
184
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
153
Voted
TACAS
2007
Springer
16 years 1 months ago
2007
Springer
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
180
Voted
LATIN
2004
Springer
16 years 9 days ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
180
click to vote
ECCV
2010
Springer
16 years 4 days ago
2010
Springer
We present an interactive, hybrid human-computer method for object classification. The method applies to classes of objects that are recognizable by people with appropriate expert...
200
Voted
SODA
2007
ACM
15 years 8 months ago
2007
ACM
A strong equilibrium (Aumann 1959) is a pure Nash equilibrium which is resilient to deviations by coalitions. We define the strong price of anarchy to be the ratio of the worst c...