3267 search results - page 567 / 654 » Generalized quasirandom graphs |
125
click to vote
FM
2008
Springer
15 years 6 months ago
2008
Springer
We focus on synthesis techniques for transforming existing fault-intolerant real-time programs to fault-tolerant programs that provide phased recovery. A fault-tolerant program is ...
161
click to vote
AAAI
2010
15 years 6 months ago
2010
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
138
click to vote
IPCO
2010
15 years 6 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
132
click to vote
OPODIS
2008
15 years 6 months ago
2008
Abstract. We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The p...
137
click to vote
OPODIS
2008
15 years 6 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...