Sciweavers

738 search results - page 36 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
FIRBPERF
2005
IEEE
235views Algorithms» more  FIRBPERF 2005»
15 years 3 months ago
Performance Model Building of Pervasive Computing
Performance model building is essential to predict the ability of an application to satisfy given levels of performance or to support the search for viable alternatives. Using aut...
Andrea D'Ambrogio, Giuseppe Iazeolla
IPPS
1993
IEEE
15 years 1 months ago
New Wormhole Routing Algorithms for Multicomputers
Abstract. Development of wormhole routing techniques so far has been largely independent of the results available for store-and-forward routing in literature. In this paper, we pro...
Rajendra V. Boppana, Suresh Chalasani
HPDC
1994
IEEE
15 years 1 months ago
Design and Implementation of Parallel Algorithms for Gene-Finding
Finding genes unequivocally in DNA sequences is one of the key goals of the Human Genome project. The human genome is a 9 billion character long DNA sequence and is estimated to c...
James Puthukattukaran, Suresh Chalasani, Periannan...
ICLP
2004
Springer
15 years 3 months ago
Non-viability Deductions in Arc-Consistency Computation
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
Camilo Rueda, Frank D. Valencia
DSN
2003
IEEE
15 years 3 months ago
Comparison of Failure Detectors and Group Membership: Performance Study of Two Atomic Broadcast Algorithms
Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While many protocols have been published, little has been done to ana...
Péter Urbán, Ilya Shnayderman, Andr&...