Sciweavers

58 search results - page 3 / 12
» Graph-based quadratic optimization: A fast evolutionary appr...
Sort
View
PLDI
2004
ACM
14 years 27 days ago
Fast searches for effective optimization phase sequences
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
Prasad Kulkarni, Stephen Hines, Jason Hiser, David...
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
13 years 8 months ago
Unsupervised learning of echo state networks: balancing the double pole
A possible alternative to fine topology tuning for Neural Network (NN) optimization is to use Echo State Networks (ESNs), recurrent NNs built upon a large reservoir of sparsely r...
Fei Jiang, Hugues Berry, Marc Schoenauer
MICAI
2005
Springer
14 years 29 days ago
Hybrid Particle Swarm - Evolutionary Algorithm for Search and Optimization
Particle Swarm Optimization (PSO) technique has proved its ability to deal with very complicated optimization and search problems. Several variants of the original algorithm have b...
Crina Grosan, Ajith Abraham, Sangyong Han, Alexand...
GD
2005
Springer
14 years 1 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
CVPR
2003
IEEE
14 years 23 days ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo