Sciweavers

8413 search results - page 174 / 1683
» Ordering Problem Subgoals
Sort
View
SARA
2007
Springer
14 years 4 months ago
Reformulating Constraint Satisfaction Problems to Improve Scalability
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...
SAT
2004
Springer
95views Hardware» more  SAT 2004»
14 years 4 months ago
Local Search for Very Large SAT Problems
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...
Steven David Prestwich, Colin Quirke
ISTCS
1993
Springer
14 years 2 months ago
The Minimum Reservation Rate Problem in Digital Audio/Video Systems
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...
Nimrod Megiddo, Moni Naor, David P. Anderson
ACL
2006
14 years 3 days ago
Dependencies between Student State and Speech Recognition Problems in Spoken Tutoring Dialogues
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...
Mihai Rotaru, Diane J. Litman
AIPS
2006
14 years 3 days ago
Resource Contention Metrics for Oversubscribed Scheduling Problems
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...
Laurence A. Kramer, Stephen F. Smith