Sciweavers

265 search results - page 38 / 53
» On the Computational Power of Neural Nets
Sort
View
PLDI
2010
ACM
16 years 3 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
GECCO
2007
Springer
195views Optimization» more  GECCO 2007»
16 years 7 days ago
MILCS: a mutual information learning classifier system
This paper introduces a new variety of learning classifier system (LCS), called MILCS, which utilizes mutual information as fitness feedback. Unlike most LCSs, MILCS is specifical...
Robert Elliott Smith, Max Kun Jiang
DATE
2008
IEEE
76views Hardware» more  DATE 2008»
16 years 16 days ago
Signal Probability Based Statistical Timing Analysis
VLSI timing analysis and power estimation target the same circuit switching activity. Power estimation techniques are categorized as (1) static, (2) statistical, and (3) simulatio...
Bao Liu
ICDAR
2007
IEEE
15 years 10 months ago
On the Use of Lexeme Features for Writer Verification
Document examiners use a variety of features to analyze a given handwritten document for writer verification. The challenge in the automatic classification of a pair of documents ...
A. Bhardwaj, A. Singh, Harish Srinivasan, Sargur N...
BMCBI
2006
123views more  BMCBI 2006»
15 years 6 months ago
Computational models with thermodynamic and composition features improve siRNA design
Background: Small interfering RNAs (siRNAs) have become an important tool in cell and molecular biology. Reliable design of siRNA molecules is essential for the needs of large fun...
Svetlana A. Shabalina, Alexey N. Spiridonov, Aleks...