Sciweavers

715 search results - page 96 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
ICTAI
1997
IEEE
15 years 1 months ago
Toward the Optimization of a Class of Black Box Optimization Algorithms
Many black box optimization algorithms have sufcient exibility to allow them to adapt to the varying circumstances they encounter. These capabilities are of two primary sorts: 1) ...
Gang Wang, Erik D. Goodman, William F. Punch III
JUCS
2010
157views more  JUCS 2010»
14 years 8 months ago
Entropy Optimization of Social Networks Using an Evolutionary Algorithm
: Recent work on social networks has tackled the measurement and optimization of these networks’ robustness and resilience to both failures and attacks. Different metrics have be...
Maytham Safar, Nosayba El-Sayed, Khaled Mahdi, Dav...
GECCO
2009
Springer
15 years 1 months ago
Evolving heuristically difficult instances of combinatorial problems
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
Bryant A. Julstrom
ICDE
2008
IEEE
158views Database» more  ICDE 2008»
15 years 11 months ago
CARE: Finding Local Linear Correlations in High Dimensional Data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
Xiang Zhang, Feng Pan, Wei Wang
UAI
2000
14 years 11 months ago
Learning to Cooperate via Policy Search
Cooperative games are those in which both agents share the same payoff structure. Valuebased reinforcement-learning algorithms, such as variants of Q-learning, have been applied t...
Leonid Peshkin, Kee-Eung Kim, Nicolas Meuleau, Les...