Sciweavers

1702 search results - page 175 / 341
» Using Nondeterminism to Design Efficient Deterministic Algor...
Sort
View
102
Voted
IPPS
1998
IEEE
15 years 6 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad
118
Voted
BMCBI
2002
100views more  BMCBI 2002»
15 years 2 months ago
An algorithm and program for finding sequence specific oligo-nucleotide probes for species identification
Background: The identification of species or species groups with specific oligo-nucleotides as molecular signatures is becoming increasingly popular for bacterial samples. However...
Alexander E. Pozhitkov, Diethard Tautz
155
Voted
POPL
2010
ACM
15 years 11 months ago
Semantics and Algorithms for Data-dependent Grammars
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
Yitzhak Mandelbaum, Trevor Jim, David Walker
113
Voted
PKDD
2009
Springer
155views Data Mining» more  PKDD 2009»
15 years 9 months ago
Dynamic Factor Graphs for Time Series Modeling
Abstract. This article presents a method for training Dynamic Factor Graphs (DFG) with continuous latent state variables. A DFG includes factors modeling joint probabilities betwee...
Piotr W. Mirowski, Yann LeCun
96
Voted
ICDCS
2008
IEEE
15 years 8 months ago
Weak vs. Self vs. Probabilistic Stabilization
Self-stabilization is a strong property which guarantees that a network always resume a correct behavior starting from an arbitrary initial state. Weaker guarantees have later bee...
Stéphane Devismes, Sébastien Tixeuil...