Sciweavers

15485 search results - page 31 / 3097
» Computing Optimal Subsets
Sort
View
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
13 years 11 months ago
Code Compaction Using Genetic Algorithms
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
Keith E. Mathias, Larry J. Eshelman, J. David Scha...
CIDM
2009
IEEE
14 years 2 months ago
Large-scale attribute selection using wrappers
Abstract— Scheme-specific attribute selection with the wrapper and variants of forward selection is a popular attribute selection technique for classification that yields good ...
Martin Gutlein, Eibe Frank, Mark Hall, Andreas Kar...
DCOSS
2006
Springer
13 years 11 months ago
Optimal Placement and Selection of Camera Network Nodes for Target Localization
The paper studies the optimal placement of multiple cameras and the selection of the best subset of cameras for single target localization in the framework of sensor networks. The ...
Ali Ozer Ercan, Danny B. Yang, Abbas El Gamal, Leo...
WWW
2009
ACM
14 years 8 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
13 years 8 months ago
A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...
Parvaz Mahdabi, Saeed Jalili, Mahdi Abadi