Co-Evolution in the Successful Learning of Backgammon Strategy
Machine Learning
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
Evolving neural networks through augmenting topologies
Evolutionary Computation
Towards Stochastic Constraint Programming: A Study of Online Multi-choice Knapsack with Deadlines
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Engineering industry controllers using neuroevolution
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
On the stochastic constraint satisfaction framework
Proceedings of the 2007 ACM symposium on Applied computing
APPSSAT: Approximate probabilistic planning using stochastic satisfiability
International Journal of Approximate Reasoning
Algorithms for stochastic CSPs
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Evolutionary optimization in uncertain environments-a survey
IEEE Transactions on Evolutionary Computation
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
Risk-averse production planning
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Stochastic constraint programming by neuroevolution with filtering
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Finding (α, ϑ)-solutions via sampled SCSPs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Filtering algorithms for global chance constraints
Artificial Intelligence
Hi-index | 0.01 |
Stochastic Constraint Programming is an extension of Constraint Programming for modelling and solving combinatorial problems involving uncertainty. A solution to such a problem is a policy tree that specifies decision variable assignments in each scenario. Several solution methods have been proposed but none seems practical for large multi-stage problems. We propose an incomplete approach: specifying a policy tree indirectly by a parameterised function, whose parameter values are found by evolutionary search. On some problems this method is orders of magnitude faster than a state-of-the-art scenario-based approach, and it also provides a very compact representation of policy trees.