Sciweavers

5115 search results - page 773 / 1023
» On Randomized Lanczos Algorithms
Sort
View
GECCO
2005
Springer
120views Optimization» more  GECCO 2005»
15 years 12 months ago
Exploiting gradient information in numerical multi--objective evolutionary optimization
Various multi–objective evolutionary algorithms (MOEAs) have obtained promising results on various numerical multi– objective optimization problems. The combination with gradi...
Peter A. N. Bosman, Edwin D. de Jong
GECCO
2005
Springer
151views Optimization» more  GECCO 2005»
15 years 12 months ago
Backward-chaining genetic programming
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
Riccardo Poli, William B. Langdon
ICAPR
2005
Springer
15 years 12 months ago
Unsupervised Markovian Segmentation on Graphics Hardware
Abstract. This contribution shows how unsupervised Markovian segmentation techniques can be accelerated when implemented on graphics hardware equipped with a Graphics Processing Un...
Pierre-Marc Jodoin, Jean-François St-Amour,...
ISLPED
2004
ACM
159views Hardware» more  ISLPED 2004»
15 years 12 months ago
Dynamic voltage scaling for systemwide energy minimization in real-time embedded systems
Traditionally, dynamic voltage scaling (DVS) techniques have focused on minimizing the processorenergy consumption as opposed to the entire system energy consumption. The slowdown...
Ravindra Jejurikar, Rajesh K. Gupta
MOBICOM
2004
ACM
15 years 12 months ago
A structured group mobility model for the simulation of mobile ad hoc networks
Realistic models for node movement are essential in simulating mobile ad hoc networks. Many MANET scenarios are most realistically represented using group movement, but existing g...
Ken Blakely, Bruce Lowekamp