Sciweavers

1026 search results - page 6 / 206
» The least-mean-magnitude-phase algorithm with applications t...
Sort
View
ICC
2007
IEEE
143views Communications» more  ICC 2007»
14 years 2 months ago
Application-Aware Topology Formation Algorithm for Peer-to-Peer Networks
—When constructing an unstructured P2P topology, one should consider the application running on top of it in order to achieve a good performance for the whole P2P system. It is n...
Kin Wah Kwong, Danny H. K. Tsang
ICDCS
2007
IEEE
14 years 2 months ago
Self-Similar Algorithms for Dynamic Distributed Systems
This paper proposes a methodology for designing a class of algorithms for computing functions in dynamic distributed systems in which communication channels and processes may ceas...
K. Mani Chandy, Michel Charpentier
ENTCS
2006
117views more  ENTCS 2006»
13 years 8 months ago
Distributed Graph Traversals by Relabelling Systems with Applications
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...
Bilel Derbel, Mohamed Mosbah
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
14 years 2 months ago
A particle swarm algorithm for symbols detection in wideband spatial multiplexing systems
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...
Adnan Ahmed Khan, Muhammad Naeem, Syed Ismail Shah
KBSE
2009
IEEE
14 years 3 months ago
Cache-Based Model Checking of Networked Applications: From Linear to Branching Time
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
Cyrille Artho, Watcharin Leungwattanakit, Masami H...