Sciweavers

388 search results - page 50 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
IJSNET
2008
125views more  IJSNET 2008»
14 years 11 months ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong
CP
2005
Springer
15 years 5 months ago
Dimensioning an Inbound Call Center Using Constraint Programming
One of the critical problems in the call center industries is the staffing problem since they must face variable demands and because staff costs represent a major part of the cost...
Cyril Canon, Jean-Charles Billaut, Jean-Louis Bouq...
DCOSS
2006
Springer
15 years 3 months ago
Approximation Algorithms for Power-Aware Scheduling of Wireless Sensor Networks with Rate and Duty-Cycle Constraints
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
Rajgopal Kannan, Shuangqing Wei
RTCSA
2006
IEEE
15 years 5 months ago
Maximizing Guaranteed QoS in (m, k)-firm Real-time Systems
(m,k)-firm constraints have been used to schedule tasks in soft/firm real-time systems under overloaded conditions. In general, they are provided by application designers to guara...
Jian (Denny) Lin, Albert M. K. Cheng
PATAT
1995
Springer
122views Education» more  PATAT 1995»
15 years 3 months ago
A Memetic Algorithm for University Exam Timetabling
The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a s...
Edmund K. Burke, James P. Newall, Rupert F. Weare