Sciweavers

1197 search results - page 159 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
ICCV
2007
IEEE
14 years 2 months ago
Learning The Discriminative Power-Invariance Trade-Off
We investigate the problem of learning optimal descriptors for a given classification task. Many hand-crafted descriptors have been proposed in the literature for measuring visua...
Manik Varma, Debajyoti Ray
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
13 years 9 months ago
ASAGA: an adaptive surrogate-assisted genetic algorithm
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
Liang Shi, Khaled Rasheed
CCGRID
2008
IEEE
14 years 2 months ago
GridBatch: Cloud Computing for Large-Scale Data-Intensive Batch Applications
To be competitive, Enterprises are collecting and analyzing increasingly large amount of data in order to derive business insights. However, there are at least two challenges to m...
Huan Liu, Dan Orban
HEURISTICS
2010
13 years 5 months ago
A shift sequence based approach for nurse scheduling and a new benchmark dataset
This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those t...
Peter Brucker, Edmund K. Burke, Timothy Curtois, R...
ICCAD
2004
IEEE
118views Hardware» more  ICCAD 2004»
14 years 5 months ago
Optimizing mode transition sequences in idle intervals for component-level and system-level energy minimization
New embedded systems offer rich power management features in the form of multiple operational and non-operational power modes. While they offer mechanisms for better energy effic...
Jinfeng Liu, Pai H. Chou