Failure models characterise the expected component failures in fault-tolerant computing. In the context of distributed systems, a failure model usually consists of two parts: a fu...
Timo Warns, Felix C. Freiling, Wilhelm Hasselbring
The essence of the signal-to-symbol problem consists of associating a symbolic description of an object (e.g., a chair) to a signal (e.g., an image) that captures the real object....
Manuela M. Veloso, Paul E. Rybski, Felix von Hunde...
Very large scale computations are now becoming routinely used as a methodology to undertake scientific research. In this context, ‘provenance systems’ are regarded as the equ...
Paul T. Groth, Simon Miles, Weijian Fang, Sylvia C...
The Mobile Internet scenario encourages the design and development of context-aware applications that provide results depending on context information, such as the relative positi...
Antonio Corradi, Rebecca Montanari, Alessandra Ton...
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...