2657 search results - page 160 / 532 » On the complexity of hierarchical problem solving |
103
click to vote
ACMSE
2006
ACM
15 years 7 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
107
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
A need for solving more and more complex problems drives the Evolutionary Computation community towards advanced models of Evolutionary Algorithms. One such model is the island mo...
107
click to vote
ICANN
2009
Springer
15 years 6 months ago
2009
Springer
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
234
Voted
ICC
2011
IEEE
14 years 1 months ago
2011
IEEE
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
101
Voted
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...