1686 search results - page 228 / 338 » Programs as polygraphs: computability and complexity |
132
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
130
click to vote
ICCS
2003
Springer
15 years 9 months ago
2003
Springer
Self-Adapting Numerical Software (SANS) systems aim to bridge the knowledge gap that exists between the expertise of domain scientists, and the know-how that is needed to fulfill...
161
click to vote
APVIS
2010
15 years 5 months ago
2010
Understanding fluid flow is a difficult problem and of increasing importance as computational fluid dynamics produces an abundance of simulation data. Experimental flow analysis h...
133
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
132
click to vote
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
Adaptive, or self-aware, computing has been proposed to help application programmers confront the growing complexity of multicore software development. However, existing approache...