4435 search results - page 253 / 887 » Algorithms, games, and the internet |
175
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
148
click to vote
TACAS
2007
Springer
16 years 26 days 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...
175
click to vote
LATIN
2004
Springer
16 years 3 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 ...
176
Voted
ECCV
2010
Springer
15 years 12 months 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...
196
click to vote
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...