Sciweavers

1243 search results - page 238 / 249
» Complexity reduction of C-Algorithm
Sort
View
ICSE
2010
IEEE-ACM
15 years 2 months ago
A methodology to support load test analysis
Performance analysts rely heavily on load testing to measure the performance of their applications under a given load. During the load test, analyst strictly monitor and record th...
Haroon Malik
GECCO
2009
Springer
193views Optimization» more  GECCO 2009»
15 years 2 months ago
Optimization of dynamic memory managers for embedded systems using grammatical evolution
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
José L. Risco-Martín, David Atienza,...
FOCS
1999
IEEE
15 years 1 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
15 years 1 months ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
ISAAC
1998
Springer
99views Algorithms» more  ISAAC 1998»
15 years 1 months ago
On the Multiple Gene Duplication Problem
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
Michael R. Fellows, Michael T. Hallett, Ulrike Ste...