172 search results - page 25 / 35 » Finding Optimal Addition Chains Using a Genetic Algorithm Ap... |
GECCO
2010
Springer
13 years 11 months ago
2010
Springer
Shaping functions can be used in multi-task reinforcement learning (RL) to incorporate knowledge from previously experienced tasks to speed up learning on a new task. So far, rese...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
LCTRTS
2010
Springer
13 years 5 months ago
2010
Springer
The issues of compiler optimization phase ordering and selection present important challenges to compiler developers in several domains, and in particular to the speed, code size,...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...