664 search results - page 17 / 133 » Solution to the Counterfeit Coin Problem and its Generalizat... |
EVOW
2005
Springer
15 years 3 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...
MSS
2008
IEEE
14 years 10 months ago
2008
IEEE
The problem of deriving weights from pairwise comparison matrices has been treated extensively in the literature. Most of the results are devoted to the case when the matrix under...
SAT
2009
Springer
15 years 4 months ago
2009
Springer
Recent work has shown the value of using unsatisfiable cores to guide maximum satisfiability algorithms (Max-SAT) running on industrial instances [5,9,10,11]. We take this concep...
101
click to vote
ICICIC
2006
IEEE
15 years 4 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...
ICFEM
2000
Springer
15 years 1 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...