Sciweavers

1157 search results - page 198 / 232
» Solving iterated functions using genetic programming
Sort
View
225
Voted
CP
2009
Springer
16 years 4 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
144
Voted
ORL
2006
105views more  ORL 2006»
15 years 3 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
TOOLS
2008
IEEE
15 years 9 months ago
The Meta in Meta-object Architectures
Abstract. Behavioral reflection is crucial to support for example functional upgrades, on-the-fly debugging, or monitoring critical applications. However the use of reflective f...
Marcus Denker, Mathieu Suen, Stéphane Ducas...
WSC
2008
15 years 5 months ago
Optimizing portfolio tail measures: Asymptotics and efficient simulation optimization
We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured th...
Sandeep Juneja
121
Voted
ATMOS
2007
152views Optimization» more  ATMOS 2007»
15 years 5 months ago
Solution of the Train Platforming Problem
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
Alberto Caprara, Laura Galli, Paolo Toth