'Electronic amoeba' finds approximate solution to traveling salesman problem in linear time
-
Researchers have, inspired by the efficient foraging behavior of a single-celled amoeba, developed an analog computer for finding a reliable and swift solution to the traveling salesman problem -- a representative combinatorial optimization problem.
I don't know about you, but I'm not sure I'd trust electronic amoeba to sell anything
-
Researchers have, inspired by the efficient foraging behavior of a single-celled amoeba, developed an analog computer for finding a reliable and swift solution to the traveling salesman problem -- a representative combinatorial optimization problem.
I don't know about you, but I'm not sure I'd trust electronic amoeba to sell anything
Kent Sharkey wrote:
a reliable and swift solution to the traveling salesman problem
The amoeba envelops and eats the salesman, problem solved.
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
-
Kent Sharkey wrote:
a reliable and swift solution to the traveling salesman problem
The amoeba envelops and eats the salesman, problem solved.
"the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle
It is the brain-eating amoeba that decides to eat the brains of the salesmen. Not finding any food, the amoeba slowly starves to death, leaving the salesmen to continue on their deathly rounds selling snake oil to the gullible public.