Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling.
Noga AlonGil KalaiMoty RicklinLarry J. StockmeyerPublished in: Theor. Comput. Sci. (1994)
Keyphrases
- lower bound
- competitive ratio
- job scheduling
- mobile users
- mobile agents
- online algorithms
- upper bound
- grid environment
- single machine
- branch and bound algorithm
- average case
- worst case
- mobile phone
- branch and bound
- distributed environment
- mobile devices
- distributed systems
- optimal solution
- lower and upper bounds
- objective function
- multi agent
- processing times
- particle filter
- np hard
- optimal strategy
- mobile applications
- distributed computing
- grid computing
- load balancing
- sample complexity
- information sources
- scheduling problem
- online learning
- lagrangian relaxation
- artificial intelligence
- resource allocation