Sciweavers

8824 search results - page 1 / 1765
» On the Complexity of Real Functions
Sort
View
FOCS
2005
IEEE
13 years 10 months ago
On the Complexity of Real Functions
We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the Computable Analysis approach. We then use...
Mark Braverman
IPPS
2002
IEEE
13 years 10 months ago
A Framework for Using Benefit Functions In Complex Real Time Systems
Researchers are currently investigating applying benefit, or utility functions for allocating resources in limited, soft real time systems [1,2,3]. While the future of real -time ...
David L. Andrews, Lonnie R. Welch, David M. Chelbe...
COMPLEX
2009
Springer
13 years 11 months ago
Characterizing the Structural Complexity of Real-World Complex Networks
Although recent research has shown that the complexity of a network depends on its structural organization, which is linked to the functional constraints the network must satisfy, ...
Jun Wang, Gregory M. Provan
JC
2006
139views more  JC 2006»
13 years 5 months ago
The basic feasible functionals in computable analysis
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...
Branimir Lambov
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
13 years 9 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook