Sciweavers

3637 search results - page 483 / 728
» On Dynamic Bit-Probe Complexity
Sort
View
STOC
2007
ACM
94views Algorithms» more  STOC 2007»
16 years 7 months ago
Constructing non-computable Julia sets
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
Mark Braverman, Michael Yampolsky
CSE
2009
IEEE
16 years 1 months ago
The Importance of Data Collection for Modelling Contact Networks
—The recently developed small wireless devices ranging from sensor boards to mobile phones provide a timely opportunity to gather unique data sets on complex human interactions, ...
Eiko Yoneki
IAT
2009
IEEE
16 years 1 months ago
Simulating BDI-Based Wireless Sensor Networks
—“Autonomic systems” merge advancements in the field of multi-agent software design, dynamic analysis, and decentralized control in order to assist designers in constructing...
Alexis Morris, Paolo Giorgini, Sameh Abdel-Naby
ESAW
2009
Springer
16 years 1 months ago
Engineering Social Reality with Inheritance Relations
Abstract. In systems based on organisational specifications a reoccurring problem remains to be solved in the disparity between the level actness of the organisational concepts an...
Huib Aldewereld, Sergio Álvarez-Napagao, Fr...
IWSOS
2009
Springer
16 years 1 months ago
Self-organization of Internet Paths
The Internet consists of a constantly evolving complex hierarchical architecture where routers are grouped into autonomous systems (ASes) that interconnect to provide global connec...
Tom Kleiberg, Piet Van Mieghem