8496 search results - page 287 / 1700 » Problem Solving and Complex Systems |
158
click to vote
ACMSE
2006
ACM
16 years 18 days 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...
165
click to vote
GECCO
2005
Springer
16 years 4 days 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...
187
click to vote
ICANN
2009
Springer
15 years 11 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 ...
180
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The generalized assignment problem (GAP) is a typical NP-hard problem and has been studied for many years mainly in the operations research community. The goal of the GAP...
190
click to vote
CP
1997
Springer
15 years 10 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...