Sciweavers

1396 search results - page 51 / 280
» aim 2006
Sort
View
AMC
2006
131views more  AMC 2006»
14 years 9 months ago
How much can analog and hybrid systems be proved (super-)Turing
Church thesis and its variants say roughly that all reasonable models of computation do not have more power than Turing machines. In a contrapositive way, they say that any model ...
Olivier Bournez
AMC
2006
89views more  AMC 2006»
14 years 9 months ago
A functional computation model for the duality of two-variable Lambda-Boolean functions
This paper presents a new functional computation model for developing a class of two-variable Lambda-Boolean functions, and describes the properties of the duality principle on th...
Tolga Güyer, Seref Mirasyedioglu
COGSCI
2006
117views more  COGSCI 2006»
14 years 9 months ago
A Model of Plausibility
Plausibility has been implicated as playing a critical role in many cognitive phenomena from comprehension to problem solving. Yet, across cognitive science, plausibility is usual...
Louise Connell, Mark T. Keane
ENTCS
2006
161views more  ENTCS 2006»
14 years 9 months ago
Tool Building Requirements for an API to First-Order Solvers
Effective formal verification tools require that robust implementations of automatic procedures for first-order logic and satisfiability modulo theories be integrated into express...
Jim Grundy, Thomas F. Melham, Sava Krstic, Sean Mc...
ENTCS
2006
143views more  ENTCS 2006»
14 years 9 months ago
Component-Oriented Specification of Performance Measures
Formal notations for system performance modeling need to be equipped with suitable notations for specifying performance measures. These companion notations have been traditionally...
Alessandro Aldini, Marco Bernardo