Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract)
Noga AlonGil KalaiMoty RicklinLarry J. StockmeyerPublished in: FOCS (1992)
Keyphrases
- extended abstract
- lower bound
- competitive ratio
- job scheduling
- mobile users
- online algorithms
- mobile agents
- upper bound
- grid environment
- single machine
- branch and bound algorithm
- distributed systems
- branch and bound
- mobile phone
- np hard
- average case
- worst case
- objective function
- load balancing
- optimal solution
- lower and upper bounds
- context aware
- mobile applications
- particle filter
- agent technology
- mobile devices
- multi agent
- processing times
- vc dimension
- resource allocation
- databases
- information sources
- online learning
- peer to peer
- learning algorithm
- convergence rate
- distributed environment
- distributed computing
- sample complexity
- optimal strategy
- scheduling problem
- special case