Sciweavers

429 search results - page 15 / 86
» Turing computations on ordinals
Sort
View
FSTTCS
2009
Springer
15 years 4 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
WSCG
2001
134views more  WSCG 2001»
14 years 11 months ago
Synthetic Images of Underwater Scenes: A First Approximation
The creation and rendering of realistic water scenes is one of the challenging tasks in Computer Graphics. To reproduce the illumination and colour inside water bodies an algorith...
Eva Cerezo, Francisco J. Serón
92
Voted
ENTCS
2006
136views more  ENTCS 2006»
14 years 9 months ago
Classically-controlled Quantum Computation
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
Simon Perdrix, Philippe Jorrand
79
Voted
ICPPW
2009
IEEE
15 years 4 months ago
Fast Autotuning Configurations of Parameters in Distributed Computing Systems Using Ordinal Optimization
Conventional autotuning configuration of parameters in distributed computing systems using evolutionary strategies increases integrated performance notably, though at the expense ...
Fan Zhang, Junwei Cao, Lianchen Liu, Cheng Wu