Sciweavers

151 search results - page 1 / 31
» Constraint Satisfiability Algorithms for Interactive Student...
Sort
View
IJCAI
1989
13 years 6 months ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Ronen Feldman, Martin Charles Golumbic
PATAT
2000
Springer
124views Education» more  PATAT 2000»
13 years 8 months ago
Tabu Search Techniques for Examination Timetabling
Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...
Luca Di Gaspero, Andrea Schaerf
ICN
2005
Springer
13 years 10 months ago
Maximizing System Value Among Interested Packets While Satisfying Time and Energy Constraints
: Data filtering is an important approach to reduce energy consumption. Following this idea, Interest is used as a constraint to filter uninterested data in sensor networks. Within...
Lei Shu, Sungyoung Lee, Xiaoling Wu, Jie Yang
RTSS
2002
IEEE
13 years 9 months ago
Maximizing the System Value while Satisfying Time and Energy Constraints
Typical real-time scheduling theory has addressed deadline and energy constraints as well as deadline and reward constraints simultaneously in the past. However, we believe that e...
Cosmin Rusu, Rami G. Melhem, Daniel Mossé
AIR
1999
90views more  AIR 1999»
13 years 4 months ago
A Survey of Automated Timetabling
The timetabling problem consists in scheduling a sequence of lectures between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints...
Andrea Schaerf