Sciweavers

2413 search results - page 323 / 483
» Models for universal usability
Sort
View
CAGD
2006
97views more  CAGD 2006»
13 years 10 months ago
Conditions for use of a non-selfintersection conjecture
Abstract. Volino and Thalmann have published a conjecture proposing sufficient conditions for non-selfintersection of surfaces. Such conditions may be used in solid modeling, compu...
Lars-Erik Andersson, Neil F. Stewart, Malika Zidan...
IANDC
2006
83views more  IANDC 2006»
13 years 10 months ago
Implicit complexity over an arbitrary structure: Quantifier alternations
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
CORR
2007
Springer
169views Education» more  CORR 2007»
13 years 10 months ago
Algorithmic Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...
CORR
2007
Springer
141views Education» more  CORR 2007»
13 years 10 months ago
Managing Uncertainty: A Case for Probabilistic Grid Scheduling
The Grid technology is evolving into a global, service-orientated architecture – a universal platform for delivering future high demand computational services. Strong adoption of...
Aleksandar Lazarevic, Lionel Sacks, Ognjen Prnjat
CCE
2004
13 years 10 months ago
Workflow and information centered support of design processes - the IMPROVE perspective
Design process excellence is considered a major differentiating factor between competing enterprises since it determines the constraints within which plant operation and supply ch...
Wolfgang Marquardt, Manfred Nagl