Sciweavers

24421 search results - page 439 / 4885
» Communicating Complex Systems
Sort
View
SIAMCOMP
2000
74views more  SIAMCOMP 2000»
15 years 4 months ago
On Quiescent Reliable Communication
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process cra...
Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
AINA
2007
IEEE
15 years 8 months ago
An Agent-Based Architecture for Context-Aware Communication
We propose an agent-based architecture that allows context-aware communication between users. In seeking a model that is suitable for the design of the required functionalities of...
Romelia Plesa, Luigi Logrippo
RTA
2010
Springer
15 years 8 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
ADVCS
2004
65views more  ADVCS 2004»
15 years 4 months ago
Multiscale Complexity/Entropy
We discuss the role of scale dependence of entropy/complexity and its relationship to component interdependence. The complexity as a function of scale of observation is expressed ...
Y. Bar-Yam
ICS
2009
Tsinghua U.
15 years 11 months ago
Towards 100 gbit/s ethernet: multicore-based parallel communication protocol design
Ethernet line rates are projected to reach 100 Gbits/s by as soon as 2010. While in principle suitable for high performance clustered and parallel applications, Ethernet requires ...
Stavros Passas, Kostas Magoutis, Angelos Bilas