Sciweavers

1089 search results - page 140 / 218
» Bounds on generalized Frobenius numbers
Sort
View
AI
2006
Springer
13 years 9 months ago
On the computational complexity of coalitional resource games
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
Michael Wooldridge, Paul E. Dunne
CORR
2006
Springer
150views Education» more  CORR 2006»
13 years 9 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...
SIGMETRICS
2008
ACM
131views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
On the design of hybrid peer-to-peer systems
In this paper, we consider hybrid peer-to-peer systems where users form an unstructured peer-to-peer network with the purpose of assisting a server in the distribution of data. We...
Stratis Ioannidis, Peter Marbach
SETA
2010
Springer
173views Mathematics» more  SETA 2010»
13 years 7 months ago
User-Irrepressible Sequences
Protocol sequences are binary and periodic sequences used in multiple-access scheme for collision channel without feedback. Each user reads out the bits from the assigned protocol ...
Kenneth W. Shum, Yijin Zhang, Wing Shing Wong
CASES
2009
ACM
13 years 6 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis