Sciweavers

5247 search results - page 823 / 1050
» Frequency Optimized Computation Methods
Sort
View
NIPS
1997
15 years 7 months ago
Learning to Schedule Straight-Line Code
Program execution speed on modern computers is sensitive, by a factor of two or more, to the order in which instructions are presented to the processor. To realize potential execu...
J. Eliot B. Moss, Paul E. Utgoff, John Cavazos, Do...
GECCO
2008
Springer
171views Optimization» more  GECCO 2008»
15 years 7 months ago
An EDA based on local markov property and gibbs sampling
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
Siddhartha Shakya, Roberto Santana
GECCO
2008
Springer
103views Optimization» more  GECCO 2008»
15 years 7 months ago
Empirical investigations on parallel competent genetic algorithms
This paper empirically investigates parallel competent genetic algorithms (cGAs) [4]. cGAs, such as BOA [21], LINCGA [15], D5 -GA [28], can solve GA-difficult problems by automati...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama
GECCO
2008
Springer
117views Optimization» more  GECCO 2008»
15 years 7 months ago
Is "best-so-far" a good algorithmic performance metric?
In evolutionary computation, experimental results are commonly analyzed using an algorithmic performance metric called best-so-far. While best-so-far can be a useful metric, its u...
Nathaniel P. Troutman, Brent E. Eskridge, Dean F. ...
GECCO
2008
Springer
128views Optimization» more  GECCO 2008»
15 years 7 months ago
Multi-agent task allocation: learning when to say no
This paper presents a communication-less multi-agent task allocation procedure that allows agents to use past experience to make non-greedy decisions about task assignments. Exper...
Adam Campbell, Annie S. Wu, Randall Shumaker