16430 search results - page 522 / 3286 » On Computable Tree Functions |
174
click to vote
ACSC
2003
IEEE
16 years 10 days ago
2003
IEEE
The ability for multiple threads to enter the same graph node without contention and conflict is a necessary component of the graph reduction of functional languages since graph c...
202
click to vote
CIE
2010
Springer
15 years 12 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
180
click to vote
CGI
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper focuses on an approach to modeling shapes through the use of evolutionary optimization or genetic algorithms for functionally represented geometric objects. This repres...
169
click to vote
AICCSA
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper proposes functional networks as an unconstrained classifier scheme for multivariate data to diagnose the breast cancer tumor. The performance of this new technique is m...
181
click to vote
AFP
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. These notes discuss the simultaneous use of generalised fold operators and monads to structure functional programs. Generalised fold operators structure programs after th...