Sciweavers

598 search results - page 96 / 120
» Procedure Based Program Compression
Sort
View
LOGCOM
1998
126views more  LOGCOM 1998»
13 years 7 months ago
Engineering AgentSpeak(L): A Formal Computational Model
Perhaps the most successful agent architectures, and certainly the best known, are those based on the Belief-Desire-Intention (BDI) framework. Despite the wealth of research that ...
Mark d'Inverno, Michael Luck
SAS
2010
Springer
143views Formal Methods» more  SAS 2010»
13 years 6 months ago
Points-to Analysis as a System of Linear Equations
The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advanc...
Rupesh Nasre, Ramaswamy Govindarajan
TSD
2010
Springer
13 years 6 months ago
Diagnostics for Debugging Speech Recognition Systems
Modern speech recognition applications are becoming very complex program packages. To understand the error behaviour of the ASR systems, a special diagnosis - a procedure or a tool...
Milos Cernak
ICASSP
2011
IEEE
12 years 11 months ago
Variability regularization in large-margin classification
This paper introduces a novel regularization strategy to address the generalization issues for large-margin classifiers from the Empirical Risk Minimization (ERM) perspective. Fi...
Dwi Sianto Mansjur, Ted S. Wada, Biing-Hwang Juang
BMCBI
2007
102views more  BMCBI 2007»
13 years 7 months ago
Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
Luis A. Diago, Persy Morell, Longendri Aguilera, E...