Sciweavers

1095 search results - page 214 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
84
Voted
ML
2006
ACM
14 years 9 months ago
Universal parameter optimisation in games based on SPSA
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
Levente Kocsis, Csaba Szepesvári
IEEECIT
2010
IEEE
14 years 7 months ago
XMalloc: A Scalable Lock-free Dynamic Memory Allocator for Many-core Machines
There are two avenues for many-core machines to gain higher performance: increasing the number of processors, and increasing the number of vector units in one SIMD processor. A tru...
Xiaohuang Huang, Christopher I. Rodrigues, Stephen...
BMCBI
2004
156views more  BMCBI 2004»
14 years 9 months ago
DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors
Background: Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results: Herein, a parallel version of the multi-alignment program...
Martin Schmollinger, Kay Nieselt, Michael Kaufmann...
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
15 years 10 months ago
De-duping URLs via rewrite rules
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
Anirban Dasgupta, Ravi Kumar, Amit Sasturkar
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
15 years 6 months ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah