Sciweavers

15792 search results - page 2880 / 3159
» Computational Abstraction Steps
Sort
View
ISNN
2010
Springer
15 years 4 months ago
Extension of the Generalization Complexity Measure to Real Valued Input Data Sets
Abstract. This paper studies the extension of the Generalization Complexity (GC) measure to real valued input problems. The GC measure, defined in Boolean space, was proposed as a...
Iván Gómez, Leonardo Franco, Jos&eac...
ISOLA
2010
Springer
15 years 4 months ago
Towards an Architecture for Runtime Interoperability
Abstract. Interoperability remains a fundamental challenge when connecting heterogeneous systems which encounter and spontaneously communicate with one another in pervasive computi...
Amel Bennaceur, Gordon S. Blair, Franck Chauvel, G...
JCAMD
2010
65views more  JCAMD 2010»
15 years 4 months ago
Analysis of SM8 and Zap TK calculations and their geometric sensitivity
Abstract A prospective study of aqueous solvation energies was done using the SM8 and Zap TK models for a variety of geometries. CM4M charges calculated with M06 and M06-2X were fo...
Benjamin A. Ellingson, A. Geoffrey Skillman, Antho...
JCNS
2010
126views more  JCNS 2010»
15 years 4 months ago
Calibration of the head direction network: a role for symmetric angular head velocity cells
Abstract Continuous attractor networks require calibration. Computational models of the head direction (HD) system of the rat usually assume that the connections that maintain HD n...
Peter Stratton, Gordon Wyeth, Janet Wiles
JELIA
2010
Springer
15 years 4 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
« Prev « First page 2880 / 3159 Last » Next »