Practice and Theory of Automated Timetabling: First International Conference, Edinburgh, UK, August 29 - September 1, 1995. Selected Papers: Lecture Notes in Computer Science, cartea 1153
Editat de Edmund Burke, Peter Rossen Limba Engleză Paperback – 2 oct 1996
This is the first book entirely devoted to automated timetabling and meets the clear need for a wide-ranging survey of the state of the art in the area. The book contains four survey papers by leading experts together with 19 revised full papers presenting new results; the papers are organized in topical sections on reasoning about constraints, genetic algorithms, complexity issues, and tabu search and simulated annealing.
Din seria Lecture Notes in Computer Science
- 20% Preț: 741.34 lei
- 20% Preț: 340.22 lei
- 20% Preț: 343.43 lei
- 20% Preț: 315.18 lei
- 20% Preț: 327.41 lei
- 20% Preț: 1031.06 lei
- 20% Preț: 438.67 lei
- 20% Preț: 315.76 lei
- 20% Preț: 330.61 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 995.03 lei
- 20% Preț: 562.71 lei
- 20% Preț: 237.99 lei
- 20% Preț: 504.57 lei
- 20% Preț: 332.20 lei
- 15% Preț: 563.85 lei
- 20% Preț: 636.26 lei
- 5% Preț: 365.59 lei
- 20% Preț: 321.95 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.38 lei
- Preț: 370.38 lei
- 20% Preț: 172.68 lei
- 20% Preț: 315.76 lei
- 20% Preț: 662.78 lei
- 20% Preț: 256.26 lei
- 20% Preț: 440.36 lei
- 20% Preț: 626.79 lei
- 20% Preț: 566.70 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 579.38 lei
- 20% Preț: 301.94 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 330.61 lei
- 20% Preț: 1044.38 lei
- 20% Preț: 574.58 lei
- Preț: 399.17 lei
- 20% Preț: 802.24 lei
- 20% Preț: 569.11 lei
- 20% Preț: 1374.12 lei
- 20% Preț: 333.84 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.97 lei
Preț: 383.06 lei
Nou
Puncte Express: 575
Preț estimativ în valută:
73.31€ • 77.34$ • 61.10£
73.31€ • 77.34$ • 61.10£
Carte tipărită la comandă
Livrare economică 03-17 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540617945
ISBN-10: 3540617949
Pagini: 404
Ilustrații: XV, 389 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.56 kg
Ediția:1996
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540617949
Pagini: 404
Ilustrații: XV, 389 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.56 kg
Ediția:1996
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Recent developments in practical examination timetabling.- Computer-aided school and university timetabling: The new wave.- Scheduling, timetabling and rostering — A special relationship?.- Examination timetabling in British Universities: A survey.- Employee timetabling, constraint networks and knowledge-based rules: A mixed approach.- Automated time table generation using multiple context reasonig with truth maintenance.- Investigations of a constraint logic programming approach to university timetabling.- Building University timetables using constraint logic programming.- Complete University modular timetabling using constraint logic programming.- Using Oz for college timetabling.- A smart genetic algorithm for university timetabling.- A genetic algorithm solving a weekly course-timetabling problem.- GA-based examination scheduling experience at Middle East Technical University.- Peckish initialisation strategies for evolutionary timetabling.- A memetic algorithm for university exam timetabling.- Extensions to a memetic timetabling system.- Automatic timetabling in practice.- The complexity of timetable construction problems.- Some combinatorial models for course scheduling.- The phase-transition niche for evolutionary algorithms in timetabling.- Three methods used to solve an examination timetable problem.- General cooling schedules for a simulated annealing based timetabling system.- How to decompose constrained course scheduling problems into easier assignment type subproblems.- Other timetabling papers.