Tomographie discrète
Algorithmique en ligne
Calcul quantique
Scheduling and resource allocation
Makespan
Social cost
Competitive ratio
Competitive analysis of online algorithms
Maximum throughput scheduling
Dynamic programming
Non-preemptive
Energy minimization
Gestion de tampon
Ordonnancement
Local policies
Linear search
Untrusted advice
Preemptive problems
Single machine
Algorithm A
Lot sizing
Online algorithms
Search and exploration problems
Pruning rules
Job completion
Identical machines
Performance measures
Online Learning
General class
N-line algorithms
Uncertainty
Processing time
Learning Theory
Coordination mechanisms
Scheduling
Infinite linear programming
Processing time oracle
Algorithmic aspects of networks
Randomization
Robust algorithms
Search problems
Multistage assembly problem
Complexity
Online computation
Bipartite matching
Idle time
Competitive analysis
Unrelated machines
Pure Nash equilibrium
Advice complexity
Analysis beyond the worst case
Price of anarchy
Ordonnancement en ligne
Scheduling policies
Oblivious adversary
Non-linear cost function
And phrases Online computation
Buffer management