435 search results - page 45 / 87 » Scalably distributed SystemC simulation for embedded applica... |
SRDS
2005
IEEE
15 years 5 months ago
2005
IEEE
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
101
click to vote
FTDCS
1997
IEEE
15 years 4 months ago
1997
IEEE
Though causal order of message delivery simplifies the design and development of distributed applications, the overhead of enforcing it is not negligible. Causal order algorithm w...
TROB
2008
14 years 11 months ago
2008
Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. In particular, in applications such as coverage by mobile senso...
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
— Estimation of network proximity among nodes is an important building block in several applications like service selection and composition, multicast tree formation, and overlay...
CIKM
2009
Springer
15 years 3 months ago
2009
Springer
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...