6102 search results - page 885 / 1221 » Generating Optimizing Specializers |
195
Voted
GECCO
2005
Springer
16 years 9 days ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
180
click to vote
PLDI
2004
ACM
16 years 9 days ago
2004
ACM
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...
169
click to vote
APWEB
2004
Springer
16 years 8 days ago
2004
Springer
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...
192
Voted
DSMML
2004
Springer
16 years 8 days ago
2004
Springer
Learning curves for Gaussian process (GP) regression can be strongly affected by a mismatch between the ‘student’ model and the ‘teacher’ (true data generation process), e...
181
Voted
GECCO
2004
Springer
16 years 7 days ago
2004
Springer
Genetic algorithms require relatively large computation time to solve optimization problems, especially in VLSI CAD such as module placement. Therefore, island-based parallel GAs a...