Sciweavers

1884 search results - page 30 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
93
Voted
ERSHOV
2006
Springer
15 years 1 months ago
Linear Complementarity and P-Matrices for Stochastic Games
Abstract. We define the first nontrivial polynomially recognizable subclass of P-matrix Generalized Linear Complementarity Problems (GLCPs) with a subexponential pivot rule. No suc...
Ola Svensson, Sergei G. Vorobyov
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
15 years 2 months ago
UNO Is Hard, Even for a Single Player
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...
SIROCCO
2000
14 years 11 months ago
On time versus size for monotone dynamic monopolies in regular topologies
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
Paola Flocchini, Rastislav Kralovic, Alessandro Ro...
ECCV
2010
Springer
15 years 3 months ago
Visual Recognition With Humans in the Loop
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...
CCCG
2010
14 years 11 months ago
Computing the straight skeleton of a monotone polygon in O(n log n) time
The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in self-parallel manner [2]. In this paper, we propose a sim...
Gautam K. Das, Asish Mukhopadhyay, Subhas C. Nandy...