14386 search results - page 308 / 2878 » The Chinese Generals Problem |
153
click to vote
SAT
2007
Springer
15 years 11 months ago
2007
Springer
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
139
Voted
STACS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
131
click to vote
APPT
2005
Springer
15 years 10 months ago
2005
Springer
By reasonably allocating a cooperative problem which need multiple solvers cope with together, the problem could be performed more effectively and efficiently. A problem could be d...
154
click to vote
EVOW
2005
Springer
15 years 10 months ago
2005
Springer
This paper presents the Scatter Search Particle Filter (SSPF) algorithm and its application to the Dynamic Travelling Salesman Problem (DTSP). SSPF combines sequential estimation a...
150
Voted
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
This paper proposes an estimation of distribution algorithm (EDA) aiming at addressing globally multimodal problems, i.e., problems that present several global optima. It can be r...