Sciweavers

1477 search results - page 198 / 296
» Random Convex Programs
Sort
View
AMAI
2008
Springer
13 years 9 months ago
Bayesian learning of Bayesian networks with informative priors
This paper presents and evaluates an approach to Bayesian model averaging where the models are Bayesian nets (BNs). Prior distributions are defined using stochastic logic programs...
Nicos Angelopoulos, James Cussens
EOR
2010
110views more  EOR 2010»
13 years 9 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
IJHIS
2007
89views more  IJHIS 2007»
13 years 9 months ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena
SIMPRA
2008
99views more  SIMPRA 2008»
13 years 9 months ago
Response surface methodology for constrained simulation optimization: An overview
This article summarizes `Generalized Response Surface Methodology'(GRSM), extending Box and Wilson's `Response Surface Methodology'(RSM). GRSM allows multiple rando...
Jack P. C. Kleijnen
JAIR
2010
99views more  JAIR 2010»
13 years 7 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...