36320 search results - page 7136 / 7264 » From Code to Models |
133
Voted
COMPGEOM
1992
ACM
15 years 7 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 ...
134
Voted
CONCUR
1992
Springer
15 years 7 months ago
1992
Springer
Petri Place/Transition (PT) nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the "...
170
Voted
PPSN
1994
Springer
15 years 7 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...
146
Voted
SIGGRAPH
1993
ACM
15 years 7 months ago
1993
ACM
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
136
click to vote
STOC
1993
ACM
15 years 7 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...