Sciweavers

583 search results - page 63 / 117
» New algorithms for efficient parallel string comparison
Sort
View
120
Voted
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
15 years 6 months ago
Compressed Pattern Matching in DNA Sequences
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
Lei Chen, Shiyong Lu, Jeffrey L. Ram
ICRA
2008
IEEE
119views Robotics» more  ICRA 2008»
15 years 9 months ago
Distributed, dynamic, and autonomous reconfiguration planning for chain-type self-reconfigurable robots
— This paper presents a dynamic and distributed reconfiguration planning algorithm for chain-type selfreconfigurable robots, by which a robot can autonomously self-reconfigure fr...
Feili Hou, Wei-Min Shen
122
Voted
PODC
2009
ACM
16 years 3 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
119
Voted
SIGCOMM
2009
ACM
15 years 9 months ago
Optimizing the BSD routing system for parallel processing
The routing architecture of the original 4.4BSD [3] kernel has been deployed successfully without major design modification for over 15 years. In the unified routing architectur...
Qing Li, Kip Macy
112
Voted
ATAL
2006
Springer
15 years 6 months ago
Integrating parallel interactions into cooperative search
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
Efrat Manisterski, David Sarne, Sarit Kraus