Sciweavers

1410 search results - page 153 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
AAAI
1998
15 years 1 months ago
Finding Optimal Strategies for Imperfect Information Games
Weexaminethree heuristic algorithms for gameswith imperfect information: Monte-carlo sampling, and two newalgorithms wecall vector minimaxingand payoffreduction minimaxing. Wecomp...
Ian Frank, David A. Basin, Hitoshi Matsubara
ATAL
2006
Springer
15 years 3 months ago
Learning the task allocation game
The distributed task allocation problem occurs in domains like web services, the grid, and other distributed systems. In this problem, the system consists of servers and mediators...
Sherief Abdallah, Victor R. Lesser
SIAMCOMP
2008
104views more  SIAMCOMP 2008»
14 years 11 months ago
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
Jochen Könemann, Stefano Leonardi, Guido Sch&...
CEC
2005
IEEE
15 years 1 months ago
Equilibrium selection by co-evolution for bargaining problems under incomplete information about time preferences
Abstract- The main purpose of this work is to measure the effect of bargaining players’ information completeness on agreements in evolutionary environments. We apply Co-evolution...
Nanlin Jin
ECCV
2008
Springer
16 years 1 months ago
Edge-Preserving Smoothing and Mean-Shift Segmentation of Video Streams
Video streams are ubiquitous in applications such as surveillance, games, and live broadcast. Processing and analyzing these data is challenging because algorithms have to be effic...
Sylvain Paris