79 search results - page 12 / 16 » An Online Algorithm for Maximizing Submodular Functions |
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
ECRTS
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper, we explore the feasibility and performance optimization problems for real-time systems that must remain functional during an operation/mission with a fixed, initial...
RTSS
2007
IEEE
14 years 1 months ago
2007
IEEE
Many distributed real-time systems face the challenge of dynamically maximizing system utility and meeting stringent resource constraints in response to fluctuations in system wo...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...