Sciweavers

831 search results - page 160 / 167
» Finding Minimum Data Requirements Using Pseudo-independence
Sort
View
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
INFOCOM
2005
IEEE
14 years 1 months ago
BARD: Bayesian-assisted resource discovery in sensor networks
Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the mos...
Fred Stann, John S. Heidemann
ATAL
2006
Springer
13 years 11 months ago
Evolutionary Optimization of ZIP60: A Controlled Explosion in Hyperspace
The "ZIP" adaptive trading algorithm has been demonstrated to outperform human traders in experimental studies of continuous double auction (CDA) markets. The original Z...
Dave Cliff
ESWS
2008
Springer
13 years 9 months ago
OntoGame: Weaving the Semantic Web by Online Games
Most of the challenges faced when building the Semantic Web require a substantial amount of human labor and intelligence. Despite significant advancement in ontology learning and h...
Katharina Siorpaes, Martin Hepp
ICPP
1997
IEEE
13 years 11 months ago
The Affinity Entry Consistency Protocol
In this paper we propose a novel software-only distributed sharedmemory system (SW-DSM), the Affinity Entry Consistency (AEC) protocol. The protocol is based on Entry Consistency ...
Cristiana Bentes Seidel, Ricardo Bianchini, Claudi...