Sciweavers

289 search results - page 50 / 58
» Simple COMA Node Implementations
Sort
View
JCB
2006
115views more  JCB 2006»
13 years 8 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
TON
2002
91views more  TON 2002»
13 years 8 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
TMC
2010
138views more  TMC 2010»
13 years 7 months ago
Distributed Relay-Assignment Protocols for Coverage Expansion in Cooperative Wireless Networks
—One important application of cooperative communications is to extend coverage area in wireless networks without increasing infrastructure. However, a crucial challenge in implem...
Ahmed K. Sadek, Zhu Han, K. J. Ray Liu
PVLDB
2010
116views more  PVLDB 2010»
13 years 3 months ago
Schism: a Workload-Driven Approach to Database Replication and Partitioning
We present Schism, a novel workload-aware approach for database partitioning and replication designed to improve scalability of sharednothing distributed databases. Because distri...
Carlo Curino, Yang Zhang, Evan P. C. Jones, Samuel...
INFOCOM
2005
IEEE
14 years 2 months ago
On the maximal throughput of networks with finite buffers and its application to buffered crossbars
— The advent of packet networks has motivated many researchers to study the performance of networks of queues in the last decade or two. However, most of the previous work assume...
Paolo Giaccone, Emilio Leonardi, Devavrat Shah