Sciweavers

1380 search results - page 250 / 276
» Computing the optimal strategy to commit to
Sort
View
ILP
2004
Springer
14 years 1 months ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...
CF
2010
ACM
14 years 1 months ago
Variant-based competitive parallel execution of sequential programs
Competitive parallel execution (CPE) is a simple yet attractive technique to improve the performance of sequential programs on multi-core and multi-processor systems. A sequential...
Oliver Trachsel, Thomas R. Gross
ICCAD
1995
IEEE
135views Hardware» more  ICCAD 1995»
13 years 12 months ago
An iterative improvement algorithm for low power data path synthesis
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
Anand Raghunathan, Niraj K. Jha
CORR
2004
Springer
180views Education» more  CORR 2004»
13 years 8 months ago
Self-Organized Stigmergic Document Maps: Environment as a Mechanism for Context Learning
Social insect societies and more specifically ant colonies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organi...
Vitorino Ramos, Juan J. Merelo Guervós
ISM
2008
IEEE
110views Multimedia» more  ISM 2008»
14 years 2 months ago
A Hardware-Independent Fast Logarithm Approximation with Adjustable Accuracy
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
Oriol Vinyals, Gerald Friedland