Sciweavers

29046 search results - page 186 / 5810
» Computable Models
Sort
View
ESANN
2008
15 years 5 months ago
Computationally Efficient Neural Field Dynamics
We propose a modification of the dynamic neural field model of Amari [1], aiming at reducing the simulation effort by employing spaceand frequency representations of the dynamic st...
Alexander Gepperth, Jannik Fritsch, Christian Goer...
IPPS
2006
IEEE
15 years 9 months ago
Multisite co-allocation algorithms for computational grid
Efficient multisite job scheduling facilitates the cooperation of multi-domain massively parallel processor systems in a computing grid environment. However, co-allocation, hetero...
Weizhe Zhang, A. M. K. Cheng, Mingzeng Hu
LOGCOM
2010
120views more  LOGCOM 2010»
14 years 10 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
TOMACS
1998
140views more  TOMACS 1998»
15 years 3 months ago
Technical Note: A Hierarchical Computer Architecture Design and Simulation Environment
architectures at multiple levels of abstraction, encompassing both hardware and software. It has five modes of operation (Design, Model Validation, Build Simulation, Simulate Syste...
Paul S. Coe, Fred W. Howell, Roland N. Ibbett, Lau...
AMC
2006
96views more  AMC 2006»
15 years 3 months ago
Analog computation beyond the Turing limit
The main purpose of this paper is quite uncontroversial. First, we recall some models of analog computations (including these allowed to perform Turing uncomputable tasks). Second...
Jerzy Mycka