Sciweavers

451 search results - page 19 / 91
» Simulated Annealing for Convex Optimization
Sort
View
ISMB
1994
13 years 11 months ago
An Efficient Method for Multiple Sequence Alignment
Multiple sequence alignment has been a useful methodin the study of molecular evolution and sequence-structure relationships. This paper presents a newmethodfor multiple sequence ...
Jin Kim, Sakti Pramanik
ML
2007
ACM
192views Machine Learning» more  ML 2007»
13 years 9 months ago
Annealing stochastic approximation Monte Carlo algorithm for neural network training
We propose a general-purpose stochastic optimization algorithm, the so-called annealing stochastic approximation Monte Carlo (ASAMC) algorithm, for neural network training. ASAMC c...
Faming Liang
FPGA
2010
ACM
359views FPGA» more  FPGA 2010»
14 years 6 months ago
Towards scalable placement for FPGAs
Placement based on simulated annealing is in dominant use in the FPGA community due to its superior quality of result (QoR). However, given the progression of FPGA device capacity...
Huimin Bian, Andrew C. Ling, Alexander Choong, Jia...
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
14 years 2 months ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...
DAC
2005
ACM
14 years 10 months ago
MiniBit: bit-width optimization via affine arithmetic
MiniBit, our automated approach for optimizing bit-widths of fixed-point designs is based on static analysis via affine arithmetic. We describe methods to minimize both the intege...
Dong-U Lee, Altaf Abdul Gaffar, Oskar Mencer, Wayn...