Sciweavers

14548 search results - page 46 / 2910
» The Optimal Path-Matching Problem
Sort
View
GECCO
2009
Springer
132views Optimization» more  GECCO 2009»
15 years 2 months ago
Cooperative micro-particle swarm optimization
Cooperative approaches have proved to be very useful in evolutionary computation due to their ability to solve efficiently high-dimensional complex problems through the cooperatio...
Konstantinos E. Parsopoulos
TSMC
2010
14 years 11 months ago
Multiobjective Optimization of Temporal Processes
Abstract--This paper presents a dynamic predictiveoptimization framework of a nonlinear temporal process. Datamining (DM) and evolutionary strategy algorithms are integrated in the...
Zhe Song, Andrew Kusiak
141
Voted
SIAMJO
2000
88views more  SIAMJO 2000»
15 years 4 months ago
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea...
IJON
1998
82views more  IJON 1998»
15 years 4 months ago
Solving arithmetic problems using feed-forward neural networks
We design new feed-forward multi-layered neural networks which perform di erent elementary arithmetic operations, such as bit shifting, addition of N p-bit numbers, and multiplica...
Leonardo Franco, Sergio A. Cannas
125
Voted
SIAMJO
2010
92views more  SIAMJO 2010»
14 years 11 months ago
Inexact Proximal Point Methods for Variational Inequality Problems
We present a new family of proximal point methods for solving monotone variational inequalities. Our algorithm has a relative error tolerance criterion in solving the proximal subp...
Regina Sandra Burachik, Joydeep Dutta