Sciweavers

2432 search results - page 344 / 487
» Using simple abstraction to reinvent computing for paralleli...
Sort
View
WIOPT
2006
IEEE
15 years 10 months ago
Fairness and throughput guarantees with maximal scheduling in multi-hop wireless networks
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
Saswati Sarkar, Prasanna Chaporkar, Koushik Kar
AUSAI
2005
Springer
15 years 9 months ago
Conditioning Graphs: Practical Structures for Inference in Bayesian Networks
Abstract. Programmers employing inference in Bayesian networks typically rely on the inclusion of the model as well as an inference engine into their application. Sophisticated inf...
Kevin Grant, Michael C. Horsch
DNA
2005
Springer
134views Bioinformatics» more  DNA 2005»
15 years 9 months ago
Complexity of Compact Proofreading for Self-assembled Patterns
Abstract. Fault-tolerance is a critical issue for biochemical computation. Recent theoretical work on algorithmic self-assembly has shown that error correcting tile sets are possib...
David Soloveichik, Erik Winfree
DNA
2005
Springer
128views Bioinformatics» more  DNA 2005»
15 years 9 months ago
Recognizing DNA Splicing
Abstract. Motivated by recent techniques developed for observing evolutionary dynamics of a single DNA molecule, we introduce a formal model for accepting an observed behavior of a...
Matteo Cavaliere, Natasa Jonoska, Peter Leupold
FOSSACS
2004
Springer
15 years 9 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas