Sciweavers

427 search results - page 44 / 86
» Computing the Local Consensus of Trees
Sort
View
185
Voted
PODC
2004
ACM
15 years 10 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
ICDCS
2006
IEEE
15 years 11 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
CORR
2007
Springer
133views Education» more  CORR 2007»
15 years 5 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
159
Voted
BMCBI
2008
114views more  BMCBI 2008»
15 years 5 months ago
Dinucleotide controlled null models for comparative RNA gene prediction
Background: Comparative prediction of RNA structures can be used to identify functional noncoding RNAs in genomic screens. It was shown recently by Babak et al. [BMC Bioinformatic...
Tanja Gesell, Stefan Washietl
GECCO
2000
Springer
122views Optimization» more  GECCO 2000»
15 years 8 months ago
Genetic Programming with Statically Scoped Local Variables
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables...
Evan Kirshenbaum