Sciweavers

526 search results - page 20 / 106
» Efficient Algorithms for Online Decision Problems
Sort
View
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
13 years 8 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
UAI
2008
13 years 11 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
FLAIRS
1998
13 years 11 months ago
Decision Making in Qualitative Influence Diagrams
The increasing number of knowledge-based systems that build on a Bayesian belief network or influence diagram acknowledge the usefulness of these frameworks for addressing complex...
Silja Renooij, Linda C. van der Gaag
WWW
2008
ACM
14 years 10 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
CCE
2004
13 years 10 months ago
Continuous reformulations of discrete-continuous optimization problems
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer n...
Oliver Stein, Jan Oldenburg, Wolfgang Marquardt