Sciweavers

3889 search results - page 282 / 778
» A Framework for Optimizing Paper Matching
Sort
View
GECCO
1999
Springer
148views Optimization» more  GECCO 1999»
15 years 11 months ago
An Analysis of Automatic Subroutine Discovery in Genetic Programming
This paper analyses Rosca's ARL as a general framework for automatic subroutine discovery. We review and compare a number of heuristics for code selection, and experimentally...
Antonello Dessi, Antonella Giani, Antonina Starita
ICDCS
2011
IEEE
14 years 6 months ago
The Routing Continuum from Shortest-Path to All-Path: A Unifying Theory
—Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”...
Yanhua Li, Zhi-Li Zhang, Daniel Boley
PODS
2004
ACM
128views Database» more  PODS 2004»
16 years 6 months ago
Replicated Declustering of Spatial Data
The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one t...
Hakan Ferhatosmanoglu, Aravind Ramachandran, Ali S...
POPL
1997
ACM
15 years 10 months ago
Synchronization Transformations for Parallel Computing
As parallel machines become part of the mainstream computing environment, compilers will need to apply synchronization optimizations to deliver e cient parallel software. This pap...
Pedro C. Diniz, Martin C. Rinard
ICASSP
2009
IEEE
16 years 1 months ago
Trajectory training considering global variance for HMM-based speech synthesis
This paper presents a novel method for training hidden Markov models (HMMs) for use in HMM-based speech synthesis. The primary goal of HMM parameter optimization is to ensure that...
Tomoki Toda, Steve Young