Name
Abstract | ||
|---|---|---|
Meeting scheduling (MS) is an important real-world problem. Solving this problem consists in scheduling all the meetings while satisfying all the constraints. However, human nature often has conflicting preferences. The majority of works, dealing with MS problem, allowed the relaxation of the preferences in order to reach an agreement between all the participants, but this is not always possible. To overcome this difficulty, the main contribution of our work consist in trying to satisfy as much as possible users' preferences while taking into consideration their availabilities, and this through a new approach based on the distributed reinforcement of arc consistency (DRAC) model. The new approach was implemented and the experimental results show that our approach is scalable and worthwhile to handle especially strong constraints. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/b97304 | IEA/AIE |
Keywords | Field | DocType |
arc consistency,satisfiability,human nature | Local consistency,Computer science,Scheduling (computing),Constraint satisfaction problem,Artificial intelligence,Reinforcement,User agent,Machine learning,Distributed computing,Scalability | Conference |
Volume | ISSN | ISBN |
3029 | 0302-9743 | 3-540-22007-0 |
Citations | PageRank | References |
4 | 0.44 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ahlem Ben Hassine | 1 | 129 | 9.04 |
| Takayuki Ito | 2 | 888 | 380.66 |
| Tu-Bao Ho | 3 | 965 | 92.59 |