Decomposition and Learning for a Hard Real Time Task Allocation Problem
- 1 January 2004
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Constraint Programming Contribution to Benders Decomposition: A Case StudyLecture Notes in Computer Science, 2002
- Local search with constraint propagation and conflict-based heuristicsArtificial Intelligence, 2002
- Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic ProgrammingLecture Notes in Computer Science, 2001
- A scheme for unifying optimization and constraint satisfaction methodsThe Knowledge Engineering Review, 2000
- Holistic schedulability analysis for distributed hard real-time systemsMicroprocessing and Microprogramming, 1994
- Allocating hard real-time tasks: An NP-Hard problem made easyReal-Time Systems, 1992
- Recent Results in the Theory of Machine SchedulingPublished by Springer Science and Business Media LLC ,1983
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962