Sciweavers

182 search results - page 13 / 37
» Information Tracking in Games on Graphs
Sort
View
CG
2006
Springer
14 years 10 days ago
A Retrograde Approximation Algorithm for One-Player Can't Stop
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
James Glenn, Haw-ren Fang, Clyde P. Kruskal
APVIS
2004
13 years 10 months ago
Graph Interaction through Force-Based Skeletal Animation
Skeletal animation is a concept that has been used in the areas of motion pictures and computer games to create realistic motion for the animation of articulated characters. Recen...
Colin Murray, Damian Merrick, Masahiro Takatsuka
COCOON
2003
Springer
14 years 1 months ago
Finding Hidden Independent Sets in Interval Graphs
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
Therese C. Biedl, Brona Brejová, Erik D. De...
CADE
2003
Springer
14 years 9 months ago
Source-Tracking Unification
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
Venkatesh Choppella, Christopher T. Haynes
WINE
2009
Springer
171views Economy» more  WINE 2009»
14 years 3 months ago
The Impact of Social Ignorance on Weighted Congestion Games
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kap...