64 search results - page 13 / 13 » Greedy wire-sizing is linear time |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time. Advertisers specify a budget constr...
ML
2008
ACM
13 years 6 months ago
2008
ACM
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
AI
1998
Springer
13 years 6 months ago
1998
Springer
Reinforcement Learning (RL) is the study of programs that improve their performance by receiving rewards and punishments from the environment. Most RL methods optimize the discoun...
MP
2002
13 years 5 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...