Sciweavers

6102 search results - page 38 / 1221
» Generating Optimizing Specializers
Sort
View
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
14 years 1 months ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf
WSC
1997
13 years 9 months ago
Panel on Transportation and Logistics Modeling
Transportation and logistics are fertile areas for modeling. Simulation has traditionally been used in warehousing and inside the distribution center or processing hub in the truc...
John S. Carson II, Mani S. Manivannan, Mark K. Bra...
ASPLOS
2006
ACM
14 years 1 months ago
Automatic generation of peephole superoptimizers
Peephole optimizers are typically constructed using human-written pattern matching rules, an approach that requires expertise and time, as well as being less than systematic at ex...
Sorav Bansal, Alex Aiken
FCCM
2004
IEEE
89views VLSI» more  FCCM 2004»
13 years 11 months ago
Word-Length Optimization of Folded Polynomial Evaluation
ended abstract presents further results from the word-length optimization system Right-Size described at FCCM 2003. The system is used to quantify the compiletime specialization s...
George A. Constantinides, Abunaser Miah, Nalin Sid...
PAMI
2007
176views more  PAMI 2007»
13 years 7 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas