Scheduling problems overall assume that it is possible to identify stable criteria definitions measuring the quality of alternatives. In real world problems however, this does not ...
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
In this work, we introduce an information-theoreticbased correction term to the likelihood ratio classification method for multiple classes. Under certain conditions, the term is ...
An efficient algorithm is presented to map an arbitrary traffic pattern and network topology on a mesh of rings network. The network is described by a two-layer model. The first la...
Monitoring user-system performance in interactive search is a challenging task. Traditional measures of retrieval evaluation, based on recall and precision, are not of any use in ...
Liudmila V. Boldareva, Arjen P. de Vries, Djoerd H...