Sciweavers

953 search results - page 181 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
ICPADS
1994
IEEE
14 years 10 days ago
Stochastic Modeling of Scaled Parallel Programs
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
VLDB
1994
ACM
118views Database» more  VLDB 1994»
14 years 9 days ago
Query Optimization by Predicate Move-Around
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagi...
CLUSTER
2007
IEEE
14 years 5 days ago
Identifying energy-efficient concurrency levels using machine learning
Abstract-- Multicore microprocessors have been largely motivated by the diminishing returns in performance and the increased power consumption of single-threaded ILP microprocessor...
Matthew Curtis-Maury, Karan Singh, Sally A. McKee,...
HPDC
2007
IEEE
14 years 3 days ago
MOB: zero-configuration high-throughput multicasting for grid applications
Grid applications often need to distribute large amounts of data efficiently from one cluster to multiple others (multicast). Existing methods usually arrange nodes in optimized t...
Mathijs den Burger, Thilo Kielmann
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 12 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini