Sciweavers

10718 search results - page 411 / 2144
» On the Circuit Implementation Problem
Sort
View
JMLR
2010
143views more  JMLR 2010»
15 years 5 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
TSMC
2010
15 years 1 months ago
A Mobile Decision Support System for Dynamic Group Decision-Making Problems
Abstract--The aim of this paper is to present a decision support system model with two important characteristic: 1) mobile technologies are applied in the decision process and 2) t...
Ignacio Javier Pérez, Francisco Javier Cabr...
CEC
2009
IEEE
16 years 1 months ago
Self modifying Cartesian Genetic Programming: Parity
— Self Modifying CGP (SMCGP) is a developmental form of Cartesian Genetic Programming(CGP). It differs from CGP by including primitive functions which modify the program. Beginni...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
FMCAD
2007
Springer
16 years 1 months ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton
GECCO
2004
Springer
211views Optimization» more  GECCO 2004»
16 years 8 days ago
Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
Alexandre C. B. Delbem, André Carlos Ponce ...