Sciweavers

1723 search results - page 100 / 345
» Cycling in linear programming problems
Sort
View
JMLR
2012
13 years 20 days ago
Deep Learning Made Easier by Linear Transformations in Perceptrons
We transform the outputs of each hidden neuron in a multi-layer perceptron network to have zero output and zero slope on average, and use separate shortcut connections to model th...
Tapani Raiko, Harri Valpola, Yann LeCun
108
Voted
EC
2008
153views ECommerce» more  EC 2008»
14 years 9 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
92
Voted
CORR
2008
Springer
126views Education» more  CORR 2008»
14 years 10 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
118
Voted
CCE
2008
14 years 10 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny
87
Voted
CPAIOR
2007
Springer
15 years 4 months ago
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
J. M. van den Akker, Guido Diepen, J. A. Hoogeveen