Sciweavers

1456 search results - page 170 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
VLDB
2007
ACM
114views Database» more  VLDB 2007»
14 years 8 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
CLUSTER
2005
IEEE
14 years 1 months ago
Efficient and Robust Computation of Resource Clusters in the Internet
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
Chuang Liu, Ian T. Foster
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 11 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
ICASSP
2010
IEEE
13 years 8 months ago
Voice source estimation for artificial bandwidth extension of telephone speech
Artificial bandwidth extension (ABWE) of speech signals aims to estimate wideband speech (50 Hz – 7 kHz) from narrowband signals (300 Hz – 3.4 kHz). Applying the source-filt...
Mark R. P. Thomas, Jon Gudnason, Patrick A. Naylor...
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
14 years 8 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...