Sciweavers

2693 search results - page 16 / 539
» On Computing Complex Navigation Functions
Sort
View
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
14 years 4 months ago
Comparison of tree and graph encodings as function of problem complexity
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 ...
Michael D. Schmidt, Hod Lipson
SIGGRAPH
1992
ACM
14 years 1 months ago
Predicting reflectance functions from complex surfaces
We describe a physically-based Monte Carlo technique for approximating bidirectional reflectance distribution functions (BRDFs) for a large class of geometries by directly simulat...
Stephen H. Westin, James Arvo, Kenneth E. Torrance
POPL
2009
ACM
14 years 10 months ago
SPEED: precise and efficient static estimation of program computational complexity
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...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
14 years 1 months ago
Bounds for the computational power and learning complexity of analog neural nets
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...
Wolfgang Maass