Sciweavers

9405 search results - page 480 / 1881
» Computing a Model of Set Theory
Sort
View
211
Voted
WOLLIC
2009
Springer
16 years 2 months ago
Recognizability in the Simply Typed Lambda-Calculus
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
Sylvain Salvati
BMCBI
2008
114views more  BMCBI 2008»
15 years 7 months ago
Testing the Coulomb/Accessible Surface Area solvent model for protein stability, ligand binding, and protein design
Background: Protein structure prediction and computational protein design require efficient yet sufficiently accurate descriptions of aqueous solvent. We continue to evaluate the ...
Marcel Schmidt am Busch, Anne Lopes, Najette Amara...
204
Voted
IJCAI
1989
15 years 8 months ago
Logic Programming with General Clauses and Defaults Based on Model Elimination
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...
200
Voted
ICAC
2007
IEEE
16 years 2 months ago
Model-Driven Autonomic Architecture
We present a generic architecture for developing fullyfledged autonomic systems out of non-autonomic components, and investigate how the architecture can be implemented using exi...
Radu Calinescu
177
Voted
DCC
2004
IEEE
16 years 7 months ago
Universal Coding of Function Spaces as a Model for Signal Compression
We address the problem of signal compression, basing on the mathematical model, in which a set of all possible signals is considered as a function space with a metric . The main a...
Boris Ryabko, Jaakko Astola