Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
Kenneth M. Bayer, Martin Michalowski, Berthe Y. Ch...
The Walksat local search algorithm has previously been extended to handle quantification over variables. This greatly reduces model sizes, but in order to guide greedy moves the a...
d Abstract) David P. Anderson Nimrod Megiddoy Moni Naorz April 1993 The \Minimum Reservation Rate Problem" arises in distributed systems for handling digital audio and video d...
Speech recognition problems are a reality in current spoken dialogue systems. In order to better understand these phenomena, we study dependencies between speech recognition probl...
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...