1763 search results - page 256 / 353 » A Formalization of Polytime Functions |
CIE
2010
Springer
15 years 1 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
CMSB
2006
Springer
15 years 1 months ago
2006
Springer
Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, d...
FORMATS
2006
Springer
15 years 1 months ago
2006
Springer
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
AOSD
2009
ACM
15 years 10 days ago
2009
ACM
Cyber-physical systems increasingly rely on dynamically adaptive programs to respond to changes in their physical environment; examples include ecosystem monitoring and disaster r...
BMCBI
2010
14 years 10 months ago
2010
Background: Biomedical research is set to greatly benefit from the use of semantic web technologies in the design of computational infrastructure. However, beyond well defined res...