Sciweavers

143 search results - page 17 / 29
» Timed CSP: A Retrospective
Sort
View
AI
1998
Springer
15 years 2 months ago
A Heuristic Incremental Modeling Approach to Course Timetabling
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
Don Banks, Peter van Beek, Amnon Meisels
FLAIRS
2008
15 years 13 days ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
76
Voted
AAAI
1990
14 years 11 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
SIGCSE
2009
ACM
139views Education» more  SIGCSE 2009»
15 years 10 months ago
On preparing students for distributed software development with a synchronous, collaborative development platform
Working remotely is becoming the norm for both professionals and students alike. Software development has become a global industry due to outsourcing, teleworking, flex time, and ...
Andrew Meneely, Laurie Williams
CHI
2006
ACM
15 years 10 months ago
The effect of speech recognition accuracy rates on the usefulness and usability of webcast archives
The widespread availability of broadband connections has led to an increase in the use of Internet broadcasting (webcasting). Most webcasts are archived and accessed numerous time...
Cosmin Munteanu, Ronald Baecker, Gerald Penn, Elai...