Sciweavers

653 search results - page 120 / 131
» Using common random numbers for indifference-zone selection
Sort
View
BMCBI
2007
133views more  BMCBI 2007»
13 years 8 months ago
MATLIGN: a motif clustering, comparison and matching tool
Background: Sequence motifs representing transcription factor binding sites (TFBS) are commonly encoded as position frequency matrices (PFM) or degenerate consensus sequences (CS)...
Matti Kankainen, Ari Löytynoja
IJSNET
2006
107views more  IJSNET 2006»
13 years 8 months ago
In-network aggregation trade-offs for data collection in wireless sensor networks
This paper explores in-network aggregation as a power-efficient mechanism for collecting data in wireless sensor networks. In particular, we focus on sensor network scenarios wher...
Ignacio Solis, Katia Obraczka
FORMATS
2006
Springer
14 years 13 days ago
Extended Directed Search for Probabilistic Timed Reachability
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
Husain Aljazzar, Stefan Leue
JSA
2007
191views more  JSA 2007»
13 years 8 months ago
Automated memory-aware application distribution for Multi-processor System-on-Chips
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
Heikki Orsila, Tero Kangas, Erno Salminen, Timo D....
AI
2002
Springer
13 years 8 months ago
Ensembling neural networks: Many could be better than all
Neural network ensemble is a learning paradigm where many neural networks are jointly used to solve a problem. In this paper, the relationship between the ensemble and its compone...
Zhi-Hua Zhou, Jianxin Wu, Wei Tang