1547 search results - page 154 / 310 » Solving Knapsack Problems in a Sticker Based Model |
136
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
127
Voted
JUCS
2010
15 years 2 months ago
2010
: In group decision making situations, there may be cases in which experts do not have an in-depth knowledge of the problem to be solved and, as a result, they may present incomple...
121
Voted
ICMLA
2009
15 years 1 months ago
2009
Abstract--This paper presents a novel and domainindependent approach for graph-based structure learning. The approach is based on solving the Maximum Common SubgraphIsomorphism pro...
140
click to vote
COR
2007
15 years 3 months ago
2007
In this paper we apply a heuristic method based on artificial neural networks (NN) in order to trace out the efficient frontier associated to the portfolio selection problem. We...
124
Voted
SIGPRO
2011
14 years 10 months ago
2011
A fast and exact procedure for the numerical synthesis of stationary multivariate Gaussian time series with a priori prescribed and well controlled autoand cross-covariance functi...