Sciweavers

2182 search results - page 88 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
ICCAD
1997
IEEE
95views Hardware» more  ICCAD 1997»
13 years 12 months ago
An exact solution to simultaneous technology mapping and linear placement problem
In this paper, we present an optimal algorithm for solving the simultaneous technology mapping and linear placement problem for tree-structured circuits with the objective of mini...
Jinan Lou, Amir H. Salek, Massoud Pedram
NIPS
2008
13 years 9 months ago
On the Generalization Ability of Online Strongly Convex Programming Algorithms
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
Sham M. Kakade, Ambuj Tewari
ICPR
2006
IEEE
14 years 8 months ago
Fingerprint Matching Method Using Minutiae Clustering and Warping
Solving non-linear distortion problems in fingerprint matching is important and still remains as a challenging topic. We have developed a new fingerprint matching method to deal w...
Dongjin Kwon, Duck Hoon Kim, Il Dong Yun, Sang Uk ...
ICRA
2009
IEEE
143views Robotics» more  ICRA 2009»
14 years 2 months ago
Least absolute policy iteration for robust value function approximation
Abstract— Least-squares policy iteration is a useful reinforcement learning method in robotics due to its computational efficiency. However, it tends to be sensitive to outliers...
Masashi Sugiyama, Hirotaka Hachiya, Hisashi Kashim...
MCS
2006
Springer
13 years 7 months ago
Variable projections neural network training
8 The training of some types of neural networks leads to separable non-linear least squares problems. These problems may be9 ill-conditioned and require special techniques. A robus...
V. Pereyra, G. Scherer, F. Wong