2413 search results - page 254 / 483 » Understanding the problem |
133
Voted
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
140
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
141
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Dimensionality reduction is a commonly used step in many algorithms for visualization, classification, clustering and modeling. Most dimensionality reduction algorithms find a low...
143
click to vote
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
156
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...