Sciweavers

8695 search results - page 15 / 1739
» Making the Complex Simple
Sort
View
ANSS
2001
IEEE
13 years 11 months ago
Models of Complex Physical Systems Using Cell-DEVS
We present the definition of diverse models of physical systems using the Cell-DEVS paradigm. Cell-DEVS is an extension of the DEVS formalism that allows the definition of cellula...
Javier Ameghino, Alejandro Troccoli, Gabriel A. Wa...
COCO
2004
Springer
133views Algorithms» more  COCO 2004»
14 years 1 months ago
Parameterized Complexity of Constraint Satisfaction Problems
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
Dániel Marx
AI
2002
Springer
13 years 7 months ago
Emergence of social conventions in complex networks
The emergence of social conventions in multi-agent systems has been analyzed mainly in settings where every agent may interact either with every other agent or with nearest neighb...
Jordi Delgado
ICNP
2005
IEEE
14 years 1 months ago
Typed Abstraction of Complex Network Compositions
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
Azer Bestavros, Adam Bradley, Assaf J. Kfoury, Ibr...
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 8 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh