Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
Abstract. As software systems become bigger and more complex, software developers need to cope with a growing amount of information and knowledge. The knowledge generated during th...
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
Moreno Falaschi, Carlos Olarte, Catuscia Palamides...
The emergence of applications domains such as pervasive and autonomic computing has increased the need for customisation and dynamic adaptation of both distributed systems, and th...
Paul Grace, Eddy Truyen, Bert Lagaisse, Wouter Joo...
In many Grid services deployments, the clients and servers reside in different administrative domains. Hence, there is a requirement both to discover each other’s authorization ...
Ionut Constandache, Daniel Olmedilla, Frank Sieben...