Sciweavers

199 search results - page 2 / 40
» Randomised Individual Communication Complexity
Sort
View
AAMAS
2002
Springer
14 years 9 months ago
Environmental Risk, Cooperation, and Communication Complexity
The evolution of collaboration and communication in communities of individuals is a puzzling problem for a wide range of scientific disciplines, spanning from evolutionary theory ...
Péter András, Gilbert Roberts, John ...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 2 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
CHI
2011
ACM
14 years 1 months ago
Collaborative creativity: a complex systems model with distributed affect
The study of creativity has received significant attention over the past century, with a recent increase in interest in collaborative, distributed creativity. We posit that creati...
Cecilia R. Aragon, Alison Williams
JCM
2008
242views more  JCM 2008»
14 years 9 months ago
SimANet - A Large Scalable, Distributed Simulation Framework for Ambient Networks
In this paper, we present a new simulation platform for complex, radio standard spanning mobile Ad Hoc networks. SimANet - Simulation Platform for Ambient Networks - allows the coe...
Matthias Vodel, Matthias Sauppe, Mirko Caspar, Wol...
COCO
2007
Springer
91views Algorithms» more  COCO 2007»
15 years 3 months ago
Lower Bounds for Multi-Player Pointer Jumping
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
Amit Chakrabarti