Sciweavers

604 search results - page 45 / 121
» Stochastic Offline Programming
Sort
View
112
Voted
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 8 months ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
127
Voted
AIPS
2008
15 years 5 months ago
Stochastic Planning with First Order Decision Diagrams
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Saket Joshi, Roni Khardon
103
Voted
ICTAI
2005
IEEE
15 years 8 months ago
Reachability Analysis for Uncertain SSPs
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
Olivier Buffet
91
Voted
EOR
2006
97views more  EOR 2006»
15 years 2 months ago
Bayesian portfolio selection with multi-variate random variance models
We consider multi-period portfolio selection problems for a decision maker with a specified utility function when the variance of security returns is described by a discrete time ...
Refik Soyer, Kadir Tanyeri
121
Voted
PLDI
1996
ACM
15 years 6 months ago
Realistic Compilation by Partial Evaluation
Two key steps in the compilation of strict functional languages are the conversion of higher-order functions to data structures (closures) and the transformation to tail-recursive...
Michael Sperber, Peter Thiemann