Sciweavers

3563 search results - page 567 / 713
» Scheduling Algorithms for Procrastinators
Sort
View
EOR
2008
140views more  EOR 2008»
15 years 4 months ago
Combining two pheromone structures for solving the car sequencing problem with Ant Colony Optimization
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algor...
Christine Solnon
IJSNET
2008
125views more  IJSNET 2008»
15 years 4 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
155
Voted
AI
2005
Springer
15 years 4 months ago
Asynchronous aggregation and consistency in distributed constraint satisfaction
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
Marius-Calin Silaghi, Boi Faltings
PR
2000
130views more  PR 2000»
15 years 4 months ago
Self-annealing and self-annihilation: unifying deterministic annealing and relaxation labeling
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
Anand Rangarajan
AIR
1999
90views more  AIR 1999»
15 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