14382 search results - page 2800 / 2877 » Time in Connectionist Models |
COMPGEOM
1992
ACM
14 years 1 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
PPSN
1994
Springer
14 years 1 months ago
1994
Springer
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
SPAA
1993
ACM
14 years 1 months ago
1993
ACM
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
PLISP
1989
14 years 1 months ago
1989
Speculative computing is a technique to improve the execution time of certain applications by starting some computations before it is known that the computations are required. A s...
WMRD
1990
14 years 1 months ago
1990
Ficus is a replicated general ling environment for Unix intended to scale to very large nationwide networks. The system employs an optimistic one copy availability" model in ...