Sciweavers

196 search results - page 14 / 40
» EXACT: the experimental algorithmics computational toolkit
Sort
View
SC
2004
ACM
14 years 1 months ago
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table
A Replica Location Service (RLS) allows registration and discovery of data replicas. In earlier work, we proposed an RLS framework and described the performance and scalability of...
Min Cai, Ann L. Chervenak, Martin R. Frank
DAC
2003
ACM
14 years 9 months ago
Large-scale SOP minimization using decomposition and functional properties
In some cases, minimum Sum-Of-Products (SOP) expressions of Boolean functions can be derived by detecting decomposition and observing the functional properties such as unateness, ...
Alan Mishchenko, Tsutomu Sasao
JSC
2007
97views more  JSC 2007»
13 years 8 months ago
On approximate triangular decompositions in dimension zero
Triangular decompositions for systems of polynomial equations with n variables, with exact coefficients, are well developed theoretically and in terms of implemented algorithms i...
Marc Moreno Maza, Gregory J. Reid, Robin Scott, We...
RECOMB
2010
Springer
13 years 6 months ago
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers
(Motivation) Tree reconciliation is an approach that explains the discrepancies between two evolutionary trees by a number of events such as speciations, duplications, transfers an...
Jean-Philippe Doyon, Celine Scornavacca, K. Yu. Go...
AINA
2009
IEEE
14 years 2 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin