Sciweavers

2814 search results - page 158 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
128
Voted
ICDCS
2006
IEEE
15 years 8 months ago
Analysis of Clustering and Routing Overhead for Clustered Mobile Ad Hoc Networks
This paper presents an analysis of the control overhead involved in clustering and routing for one-hop clustered mobile ad hoc networks. Previous work on the analysis of control o...
Mingqiang Xue, Inn Inn Er, Winston Khoon Guan Seah
83
Voted
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
16 years 3 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
120
Voted
JCSS
2007
63views more  JCSS 2007»
15 years 2 months ago
Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling
In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task ...
Rodolfo Pellizzoni, Giuseppe Lipari
135
Voted
WABI
2009
Springer
162views Bioinformatics» more  WABI 2009»
15 years 9 months ago
Aligning Biomolecular Networks Using Modular Graph Kernels
Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the stru...
Fadi Towfic, M. Heather West Greenlee, Vasant Hona...
121
Voted
DATE
1999
IEEE
135views Hardware» more  DATE 1999»
15 years 7 months ago
Combinational Equivalence Checking Using Satisfiability and Recursive Learning
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
João P. Marques Silva, Thomas Glass