This paper considers a solution to the school timetabling problem. The timetabling problem involves scheduling a number of tuples, each consisting of class of students, a teacher, a subject and a room ...

This is a preview. Log in through your library . Abstract We present a modification of the simulated annealing algorithm designed for solving discrete stochastic optimization problems. Like the ...

Dr. James McCaffrey of Microsoft Research explains a new idea that slightly modifies standard simulated annealing by borrowing ideas from quantum mechanics. The goal of a combinatorial optimization ...

If you want to simulate a tic-tac-toe game, that’s easy. You can evaluate every possible move in a reasonable amount of time. Simulating antennas, however, is much harder. [Rosrislav] has been ...

In computer science, normally we care about asymptotic speedup: We care about, “What is your running time as a function of the size of the problem? Does it grow linearly? Does it grow quadratically?” ...

Are powerful quantum computers finally here? Google is claiming that its D-Wave quantum computer can solve certain problems 100 million times faster than an ordinary computer, a result that it says ...