16626 search results - page 86 / 3326 » Computing is a natural science |
STACS
2001
Springer
15 years 6 months ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
214
Voted
ASUNAM
2011
IEEE
14 years 1 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
105
click to vote
GG
2004
Springer
15 years 7 months ago
2004
Springer
that graph transformations provide the right level of abstraction, and useful technical tools for studying gene assembly. On the other hand, the gene assembly process inspires a ne...
IFIPTCS
2010
14 years 11 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
173
click to vote
CCA
2009
Springer
15 years 6 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...