450 search results - page 6 / 90 » Adaptive Algorithms for Online Decision Problems |
CGO
2003
IEEE
14 years 9 days ago
2003
IEEE
As current trends in software development move toward more complex object-oriented programming, inlining has become a vital optimization that provides substantial performance impr...
JAIR
2008
13 years 7 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Automatic tuning has emerged as a solution to provide high-performance libraries for fast changing, increasingly complex computer architectures. We distinguish offline adaptation (...
CRV
2009
IEEE
14 years 1 months ago
2009
IEEE
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
SODA
2007
ACM
13 years 8 months ago
2007
ACM
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...