Sciweavers

1165 search results - page 118 / 233
» Effective linear programming based placement methods
Sort
View
BMCBI
2006
115views more  BMCBI 2006»
15 years 3 months ago
The accuracy of several multiple sequence alignment programs for proteins
Background: There have been many algorithms and software programs implemented for the inference of multiple sequence alignments of protein and DNA sequences. The "true" ...
Paulo A. S. Nuin, Zhouzhi Wang, Elisabeth R. M. Ti...
SIBGRAPI
2005
IEEE
15 years 8 months ago
A Maximum Uncertainty LDA-Based Approach for Limited Sample Size Problems : With Application to Face Recognition
A critical issue of applying Linear Discriminant Analysis (LDA) is both the singularity and instability of the within-class scatter matrix. In practice, particularly in image recog...
Carlos E. Thomaz, Duncan Fyfe Gillies
ICML
2008
IEEE
16 years 3 months ago
Sample-based learning and search with permanent and transient memories
We present a reinforcement learning architecture, Dyna-2, that encompasses both samplebased learning and sample-based search, and that generalises across states during both learni...
David Silver, Martin Müller 0003, Richard S. ...
ANOR
2004
116views more  ANOR 2004»
15 years 3 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
ASPDAC
2009
ACM
115views Hardware» more  ASPDAC 2009»
15 years 9 months ago
Incremental and on-demand random walk for iterative power distribution network analysis
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
Yiyu Shi, Wei Yao, Jinjun Xiong, Lei He