129 search results - page 8 / 26 » A MAX-SAT Algorithm Portfolio |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We consider the sequential portfolio investment problem. Building on results in signal processing, machine learning, and other areas, we use factor graphs to develop new universal...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
FLAIRS
2001
13 years 8 months ago
2001
Discrete optimization problemsarise throughout many real world domainsincluding planning, decision making, and search. NP-hardin general, these problems require novel approachesto...
FSS
2002
13 years 7 months ago
2002
The mean-variance methodology for the portfolio selection problem, originally proposed by Markowitz, has been one of the most important research fields in modern finance. In this ...
AIPS
2006
13 years 8 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...