Sciweavers

389 search results - page 37 / 78
» Some natural decision problems in automatic graphs
Sort
View
DM
2006
128views more  DM 2006»
13 years 9 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
ADHOC
2005
95views more  ADHOC 2005»
13 years 9 months ago
Planar graph routing on geographical clusters
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy rou...
Hannes Frey, Daniel Görgen
IGPL
2007
45views more  IGPL 2007»
13 years 9 months ago
On Positive Relational Calculi
We discuss the question of inclusions between positive relational terms and some of its aspects, using the form of a dialogue. Two possible approaches to the problem are emphasize...
Renata P. de Freitas, Paulo A. S. Veloso, Sheila R...
FSEN
2009
Springer
14 years 4 months ago
The Complexity of Reachability in Randomized Sabotage Games
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
Dominik Klein, Frank G. Radmacher, Wolfgang Thomas
AI
2004
Springer
13 years 9 months ago
On the computational complexity of qualitative coalitional games
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
Michael Wooldridge, Paul E. Dunne