Sciweavers

9842 search results - page 133 / 1969
» Problem complexity
Sort
View
AI
2006
Springer
15 years 4 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
AVI
2008
15 years 6 months ago
Visual design of service deployment in complex physical environments
In this paper we discuss the problem of deploying appliances for interactive services in complex physical environments using a knowledge based approach to define the relations bet...
Augusto Celentano, Fabio Pittarello
154
Voted
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 9 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
130
Voted
MFCS
2004
Springer
15 years 10 months ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...
109
Voted
STOC
1992
ACM
91views Algorithms» more  STOC 1992»
15 years 8 months ago
Randomized versus Nondeterministic Communication Complexity
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
Paul Beame, Joan Lawry