2693 search results - page 12 / 539 » On Computing Complex Navigation Functions |
TCS
2002
13 years 9 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
CADE
2008
Springer
13 years 11 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
IAT
2008
IEEE
13 years 10 months ago
2008
IEEE
TD-FALCON (Temporal Difference - Fusion Architecture for Learning, COgnition, and Navigation) is a class of self-organizing neural networks that incorporates Temporal Difference (...
BMCBI
2006
13 years 9 months ago
2006
Background: A key post genomics challenge is to identify how genes in an organism come together and perform physiological functions. An important first step in this direction is t...
JC
2006
13 years 9 months ago
2006
We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...