11716 search results - page 32 / 2344 » Computable symbolic dynamics |
APN
2009
Springer
14 years 1 months ago
2009
Springer
We present a symbolic method for p-semiflow computation, based on zero-suppressed decision diagrams. Both the traditional explicit methods and our new symbolic method rely on Farka...
NIPS
2000
13 years 11 months ago
2000
Experimental data show that biological synapses behave quite differently from the symbolic synapses in common artificial neural network models. Biological synapses are dynamic, i....
IFM
2009
Springer
14 years 4 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
ICPR
2004
IEEE
14 years 10 months ago
2004
IEEE
SIAMCOMP
2010
13 years 4 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...