Sciweavers

500 search results - page 43 / 100
» A parallel quadratic programming method for dynamic optimiza...
Sort
View
GECCO
2005
Springer
118views Optimization» more  GECCO 2005»
15 years 4 months ago
G2DGA: an adaptive framework for internet-based distributed genetic algorithms
The Internet is different from traditional parallel computing environments, and Distributed Genetic Algorithms (DGAs) for the Internet need to be designed to address these diffe...
Johan Berntsson
GECCO
2005
Springer
159views Optimization» more  GECCO 2005»
15 years 4 months ago
Resource-limited genetic programming: the dynamic approach
Resource-Limited Genetic Programming is a bloat control technique that imposes a single limit on the total amount of resources available to the entire population, where resources ...
Sara Silva, Ernesto Costa
NIPS
2000
15 years 15 days ago
Improved Output Coding for Classification Using Continuous Relaxation
Output coding is a general method for solving multiclass problems by reducing them to multiple binary classification problems. Previous research on output coding has employed, alm...
Koby Crammer, Yoram Singer
VLSID
2003
IEEE
103views VLSI» more  VLSID 2003»
15 years 11 months ago
Minimum Dynamic Power CMOS Circuit Design by a Reduced Constraint Set Linear Program
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
Tezaswi Raja, Vishwani D. Agrawal, Michael L. Bush...
CVPR
2008
IEEE
15 years 5 months ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie