Sciweavers

3136 search results - page 299 / 628
» Complex networks and evolutionary computation
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Using F0 to constrain the unit selection Viterbi network
The goal of the work described here is to limit the computation needed in unit selection Viterbi search for text-to-speech synthesis. The broader goal is to improve speech quality...
Alistair Conkie, Ann K. Syrdal
IPSN
2007
Springer
16 years 26 days ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
CIBCB
2007
IEEE
16 years 1 months ago
An Experimental Evaluation of Inversion-and Transposition-Based Genomic Distances through Simulations
— Rearrangements of genes and other syntenic blocks have become a topic of intensive study by phylogenists, comparative genomicists, and computational biologists: they are a feat...
Moulik Kothari, Bernard M. E. Moret
CEC
2011
IEEE
14 years 6 months ago
Ms Pac-Man versus Ghost Team CEC 2011 competition
—Games provide an ideal test bed for computational intelligence and significant progress has been made in recent years, most notably in games such as GO, where the level of play...
Philipp Rohlfshagen, Simon M. Lucas
168
Voted
SBACPAD
2007
IEEE
128views Hardware» more  SBACPAD 2007»
16 years 1 months ago
Node Level Primitives for Parallel Exact Inference
We present node level primitives for parallel exact inference on an arbitrary Bayesian network. We explore the probability representation on each node of Bayesian networks and eac...
Yinglong Xia, Viktor K. Prasanna