An empirical analysis of algorithms for partially Clairvoyant scheduling
DOI10.1080/17445760601029560zbMath1124.68015MaRDI QIDQ5421611
K. Subramani and Vahan Mkrtchyan, D. Desovski
Publication date: 24 October 2007
Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/17445760601029560
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68W30: Symbolic computation and algebraic computation
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68Q60: Specification and verification (program logics, model checking, etc.)
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68W20: Randomized algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Designing deductive databases
- Scheduling real-time computations with separation constraints
- An analysis of partially Clairvoyant scheduling
- Out of order quantifier elimination for standard quantified linear programs
