79 search results - page 11 / 16 » An Online Algorithm for Maximizing Submodular Functions |
144
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Online Convex Programming (OCP) is a recently developed model of sequential decision-making in the presence of time-varying uncertainty. In this framework, a decisionmaker selects ...
134
click to vote
APPROX
2000
Springer
15 years 7 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
156
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
133
click to vote
FGCS
2008
15 years 3 months ago
2008
Data is typically replicated in a Data Grid to improve the job response time and data availability. Strategies for data replication in a Data Grid have previously been proposed, b...
118
click to vote
AAAI
2008
15 years 5 months ago
2008
A drama manager (DM) monitors an interactive experience, such as a computer game, and intervenes to shape the global experience so it satisfies the author's expressive goals ...