Sciweavers

4889 search results - page 508 / 978
» A Refactoring Approach to Parallelism
Sort
View
IPPS
2005
IEEE
16 years 19 days ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
ISPAN
2005
IEEE
16 years 18 days ago
P2P Architecture for Self-Atomic Memory
We propose an architecture for self-adjusting and self-healing atomic memory in highly dynamic systems exploiting peer-to-peer (p2p) techniques. Our approach, named SAM, brings to...
Emmanuelle Anceaume, Maria Gradinariu, Vincent Gra...
COORDINATION
2005
Springer
16 years 17 days ago
Dynamically Adapting Tuple Replication for Managing Availability in a Shared Data Space
With its decoupling of processes in space and time, the shared data space model has proven to be a well-suited solution for developing distributed component-based systems. However,...
Giovanni Russello, Michel R. V. Chaudron, Maarten ...
COORDINATION
2004
Springer
16 years 13 days ago
On Calculi for Context-Aware Coordination
Abstract. Modern distributed computing demands unprecedented levels of dynamicity and reconfiguration. Mobile computing, peer-to-peer networks, computational grids, multiagent sys...
Pietro Braione, Gian Pietro Picco
DASFAA
2003
IEEE
151views Database» more  DASFAA 2003»
16 years 10 days ago
Approximate String Matching in DNA Sequences
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu