Sciweavers

14548 search results - page 2671 / 2910
» The Optimal Path-Matching Problem
Sort
View
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
16 years 1 days ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
16 years 14 hour ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian
ASPDAC
2004
ACM
79views Hardware» more  ASPDAC 2004»
16 years 2 hour ago
Preserving synchronizing sequences of sequential circuits after retiming
Abstract We propose a novel approach to preserve the synchronizing sequences of a circuit after retiming. The significance of this problem stems from the necessity of maintaining c...
Maher N. Mneimneh, Karem A. Sakallah, John Moondan...
ASPDAC
2004
ACM
93views Hardware» more  ASPDAC 2004»
16 years 2 hour ago
Layer assignment for reliable system-on-package
—The routing environment for the new emerging mixed-signal System-on-Package (SOP) technology is more advanced than that of the conventional PCB or MCM technology – pins are lo...
Jacob R. Minz, Sung Kyu Lim
DMSN
2004
ACM
16 years 1 hour ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine
« Prev « First page 2671 / 2910 Last » Next »