Sciweavers

13784 search results - page 159 / 2757
» On Computing Functions with Uncertainty
Sort
View
IJCNN
2008
IEEE
14 years 3 months ago
Dynamic logic of phenomena and cognition
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...
Boris Kovalerchuk, Leonid I. Perlovsky
ISIM
2007
13 years 10 months ago
Formal Computation Independent Model of the Problem Domain within the MDA
The proposed approach called Topological Functioning Modeling for Model Driven Architecture (TFMfMDA) uses formal mathematical foundations of Topological Functioning Model. It intr...
Janis Osis, Erika Asnina, Andrejs Grave
CCA
2009
Springer
14 years 1 months ago
On the Computability of Rectifiable Simple Curve (Extended Abstract)
d Abstract) Robert Rettinger1 and Xizhong Zheng2,3 1 Lehrgebiet Algorithmen und Komplexit
Robert Rettinger, Xizhong Zheng
TOCL
2002
110views more  TOCL 2002»
13 years 8 months ago
Abstract computability and algebraic specification
Computability and Algebraic Specification J. V. TUCKER University of Wales, Swansea and J. I. ZUCKER McMaster University Abstract computable functions are defined by abstract finit...
J. V. Tucker, Jeffery I. Zucker
PACT
2001
Springer
14 years 1 months ago
UNICORE: A Grid Computing Environment for Distributed and Parallel Computing
UNICORE (UNiform Interface to COmputer REsources) provides a seamless and secure access to distributed supercomputer resources. This paper will give an overview of the its architec...
Valentina Huber