11716 search results - page 237 / 2344 » Computable symbolic dynamics |
154
click to vote
ALENEX
2004
15 years 8 months ago
2004
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
163
click to vote
ISMB
1994
15 years 8 months ago
1994
The recently-developedgenetic programming paradigmisused to evoIve a computer program to classify a given protein segment as being a transmembrane domainor non-uansmembranearea of...
166
click to vote
IPPS
2007
IEEE
16 years 27 days ago
2007
IEEE
Resource performance in the Computational Grid is not only heterogeneous, but also changing dynamically. However scheduling algorithms designed for traditional parallel and distri...
178
click to vote
TACS
2001
Springer
15 years 11 months ago
2001
Springer
We propose the πD -calculus, a process calculus that can flexibly model fine-grained control of resource access in distributed computation, with a type system that statically pr...
151
click to vote
ESANN
2007
15 years 8 months ago
2007
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...