Sciweavers

5331 search results - page 761 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
GECCO
2006
Springer
156views Optimization» more  GECCO 2006»
15 years 10 months ago
Probabilistic modeling for continuous EDA with Boltzmann selection and Kullback-Leibeler divergence
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...
Yunpeng Cai, Xiaomin Sun, Peifa Jia
AAAI
2007
15 years 9 months ago
Acquiring Visibly Intelligent Behavior with Example-Guided Neuroevolution
Much of artificial intelligence research is focused on devising optimal solutions for challenging and well-defined but highly constrained problems. However, as we begin creating...
Bobby D. Bryant, Risto Miikkulainen
DAC
2005
ACM
15 years 8 months ago
Power grid simulation via efficient sampling-based sensitivity analysis and hierarchical symbolic relaxation
On-chip supply networks are playing an increasingly important role for modern nanometer-scale designs. However, the ever growing sizes of power grids make the analysis problem ext...
Peng Li
SDM
2010
SIAM
156views Data Mining» more  SDM 2010»
15 years 8 months ago
Co-selection of Features and Instances for Unsupervised Rare Category Analysis
Rare category analysis is of key importance both in theory and in practice. Previous research work focuses on supervised rare category analysis, such as rare category detection an...
Jingrui He, Jaime G. Carbonell
NIPS
2008
15 years 8 months ago
Clustering via LP-based Stabilities
A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
Nikos Komodakis, Nikos Paragios, Georgios Tziritas