Sciweavers

1763 search results - page 116 / 353
» A Formalization of Polytime Functions
Sort
View
AISC
2004
Springer
15 years 1 months ago
Four Approaches to Automated Reasoning with Differential Algebraic Structures
While implementing a proof for the Basic Perturbation Lemma (a central result in Homological Algebra) in the theorem prover Isabelle one faces problems such as the implementation o...
Jesús Aransay, Clemens Ballarin, Julio Rubi...
CORR
2002
Springer
100views Education» more  CORR 2002»
14 years 9 months ago
A neural model for multi-expert architectures
We present a generalization of conventional artificial neural networks that allows for a functional equivalence to multi-expert systems. The new model provides an architectural fr...
Marc Toussaint
JFP
2002
89views more  JFP 2002»
14 years 9 months ago
The countdown problem
We systematically develop a functional program that solves the countdown problem, a numbers game in which the aim is to construct arithmetic expressions satisfying certain constra...
Graham Hutton
JNS
2010
62views more  JNS 2010»
14 years 8 months ago
On the Existence of Quasipattern Solutions of the Swift-Hohenberg Equation
Quasipatterns (two-dimensional patterns that are quasiperiodic in any spatial direction) remain one of the outstanding problems of pattern formation. As with problems involving qu...
G. Iooss, A. M. Rucklidge
CL
2008
Springer
14 years 10 months ago
Automatic synthesis and verification of real-time embedded software for mobile and ubiquitous systems
Currently available application frameworks that target the automatic design of real-time embedded software are poor in integrating functional and non-functional requirements for m...
Pao-Ann Hsiung, Shang-Wei Lin