2693 search results - page 16 / 539 » On Computing Complex Navigation Functions |
102
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
118
Voted
SIGGRAPH
1992
ACM
15 years 6 months ago
1992
ACM
We describe a physically-based Monte Carlo technique for approximating bidirectional reflectance distribution functions (BRDFs) for a large class of geometries by directly simulat...
232
click to vote
POPL
2009
ACM
16 years 2 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
124
click to vote
STOC
1993
ACM
15 years 6 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...