165 search results - page 15 / 33 » Parallel Algorithm for Computing Reversal Distance |
CP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The availability of commodity multiprocessors offers significant opportunities for addressing the increasing computational requirements of optimization applications. To...
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
107
click to vote
DCOSS
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We have developed a new on-line error modeling and optimizationbased localization approach for sensor networks in the presence of distance measurement noise. The approach...
101
click to vote
ICDCS
2007
IEEE
15 years 8 months ago
2007
IEEE
— We introduce a virtual-node based mobile object tracking algorithm for mobile sensor networks, VINESTALK. The algorithm uses the Virtual Stationary Automata programming layer, ...
136
click to vote
JCB
2008
15 years 2 months ago
2008
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...