1816 search results - page 29 / 364 » A New Approach for Solving the Maximum Clique Problem |
114
click to vote
CEC
2008
IEEE
15 years 6 months ago
2008
IEEE
— Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global o...
NAA
2000
Springer
15 years 3 months ago
2000
Springer
In this work a grid free Monte Carlo algorithm for solving elliptic boundary value problems is investigated. The proposed Monte Carlo approach leads to a random process called a ba...
114
click to vote
SOCO
2010
Springer
14 years 6 months ago
2010
Springer
Decentralized partially observable Markov decision process (DEC-POMDP) is an approach to model multi-robot decision making problems under uncertainty. Since it is NEXP-complete the...
111
click to vote
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
132
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...