Sciweavers

231 search results - page 13 / 47
» Path disruption games
Sort
View
GLOBECOM
2007
IEEE
15 years 3 months ago
Non-Cooperative Design of Translucent Networks
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
Benoît Châtelain, Shie Mannor, Fran&cc...
CEC
2008
IEEE
15 years 4 months ago
Path optimization for multiple objectives in directed graphs using genetic algorithms
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
Juan Rada, Ruben Parma, Wilmer Pereira
89
Voted
GLOBECOM
2009
IEEE
15 years 4 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»
14 years 7 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...
64
Voted
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
14 years 11 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...