Sciweavers

1125 search results - page 26 / 225
» On the job rotation problem
Sort
View
AINA
2009
IEEE
14 years 4 months ago
A Simple Distributed ID Assignment Scheme for CSMA/IC Using Well Arranged Rotation ID in Ad Hoc Networks
Carrier Sense Multiple Access / ID Countdown (CSMA/IC) is a collision-free ad hoc MAC protocol. CSMA/IC avoids simultaneous medium access by competing with a local unique ID assig...
Ki-seok Lee, Cheeha Kim
CBMS
2006
IEEE
14 years 3 months ago
Efficient Rotation Invariant Retrieval of Shapes with Applications in Medical Databases
Recognition of shapes in images is an important problem in computer vision with application in various medical problems, including robotic surgery and cell analysis. The similarit...
Selina Chu, Shrikanth S. Narayanan, C. C. Jay Kuo
GECCO
2004
Springer
166views Optimization» more  GECCO 2004»
14 years 3 months ago
An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
Joc Cing Tay, Djoko Wibowo
KR
1992
Springer
14 years 1 months ago
Intelligent Backtracking Techniques for Job Shop Scheduling
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
Yalin Xiong, Norman M. Sadeh, Katia P. Sycara
APPROX
2009
Springer
99views Algorithms» more  APPROX 2009»
14 years 4 months ago
Resource Minimization Job Scheduling
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
Julia Chuzhoy, Paolo Codenotti