14386 search results - page 251 / 2878 » The Chinese Generals Problem |
147
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The dynamic optimization problem concerns finding an optimum in a changing environment. In the tracking problem, the optimizer should be able to follow the optimum’s changes ov...
166
click to vote
ICICIC
2006
IEEE
15 years 10 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
126
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
The interaction among variables of an optimization problem is known as epistasis, and its degree is an important measure for the nonlinearity of the problem. We address the proble...
137
click to vote
HICSS
1994
IEEE
15 years 8 months ago
1994
IEEE
Our research goal is to design systems that enable humans to teach tedious, repetitive, simple tasks to a computer. We propose here a learner/problem solver architecture for such ...
140
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...