Sciweavers

309 search results - page 36 / 62
» Path coalitional games
Sort
View
CLIMA
2011
12 years 7 months ago
Verifying Team Formation Protocols with Probabilistic Model Checking
Multi-agent systems are an increasingly important software paradigm and in many of its applications agents cooperate to achieve a particular goal. This requires the design of effi...
Taolue Chen, Marta Z. Kwiatkowska, David Parker, A...
GLOBECOM
2009
IEEE
14 years 2 months ago
PEMP: Peering Equilibrium MultiPath Routing
—It is generally admitted that Inter-domain peering links represent nowadays the main bottleneck of the Internet, particularly because of lack of coordination between providers, ...
Stefano Secci, Jean-Louis Rougier, Achille Pattavi...
ERSA
2009
149views Hardware» more  ERSA 2009»
13 years 5 months ago
Harnessing Human Computation Cycles for the FPGA Placement Problem
Harnessing human computation is an approach to find problem solutions. In this paper, we investigate harnessing this human computation for a Field Programmable Gate Array (FPGA) p...
Luke Terry, Vladimir Roitch, Shoeb Tufail, Kirit S...
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
13 years 9 months ago
Quantitative stochastic parity games
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
ACID
2006
298views Algorithms» more  ACID 2006»
13 years 9 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking