Sciweavers

257 search results - page 30 / 52
» A (Somewhat) New Solution to the Variable Binding Problem
Sort
View
SIAMJO
2010
83views more  SIAMJO 2010»
14 years 8 months ago
The Lifted Newton Method and Its Application in Optimization
Abstract. We present a new “lifting” approach for the solution of nonlinear optimization problems (NLPs) that have objective and constraint functions with intermediate variable...
Jan Albersmeyer, Moritz Diehl
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
15 years 3 months ago
Learning, anticipation and time-deception in evolutionary online dynamic optimization
In this paper we focus on an important source of problem– difficulty in (online) dynamic optimization problems that has so far received significantly less attention than the tr...
Peter A. N. Bosman
PVM
2005
Springer
15 years 3 months ago
Some Improvements to a Parallel Decomposition Technique for Training Support Vector Machines
We consider a parallel decomposition technique for solving the large quadratic programs arising in training the learning methodology Support Vector Machine. At each iteration of th...
Thomas Serafini, Luca Zanni, Gaetano Zanghirati
85
Voted
DCC
2011
IEEE
14 years 4 months ago
Sparse Boolean equations and circuit lattices
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
Igor Semaev
71
Voted
ICRA
2002
IEEE
100views Robotics» more  ICRA 2002»
15 years 2 months ago
Achieving Sharp Deliveries in Supply Chains through Variance Pool Allocation
Variability reduction and business process synchronization are acknowledged as key to achieving sharp and timely deliveries in supply chain networks. In this paper, we develop an ...
Dinesh Garg, Yadati Narahari, Nukala Viswanadham