Sciweavers

4816 search results - page 394 / 964
» Performance analysis of the AntNet algorithm
Sort
View
POPL
2003
ACM
16 years 7 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
CEC
2007
IEEE
15 years 8 months ago
Random search can outperform mutation
— Efficient discovery of lowest level building blocks is a fundamental requirement for a successful genetic algorithm. Although considerable effort has been directed at techniqu...
Cameron Skinner, Patricia J. Riddle
IJON
2010
178views more  IJON 2010»
15 years 5 months ago
An empirical study of two typical locality preserving linear discriminant analysis methods
: Laplacian Linear Discriminant Analysis (LapLDA) and Semi-supervised Discriminant Analysis (SDA) are two recently proposed LDA methods. They are developed independently with the a...
Lishan Qiao, Limei Zhang, Songcan Chen
DAC
2008
ACM
16 years 7 months ago
Stochastic modeling of a thermally-managed multi-core system
Achieving high performance under a peak temperature limit is a first-order concern for VLSI designers. This paper presents a new model of a thermally-managed system, where a stoch...
Hwisung Jung, Peng Rong, Massoud Pedram
GROUP
2009
ACM
16 years 1 months ago
Lazy scheduling of processing and transmission tasks in collaborative systems
A collaborative system must perform both processing and transmission tasks. We present a policy for scheduling these tasks on a single core that is inspired by studies of human pe...
Sasa Junuzovic, Prasun Dewan