2 search results - page 1 / 1 » The Traveling Beams Optical Solutions for Bounded NP-Complet... |
FUN
2007
Springer
13 years 10 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
LION
2009
Springer
14 years 1 months ago
2009
Springer
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...