We apply the concept of “games with a purpose” to NPcomplete mapping and scheduling problems in distributed systems and report our experiences. The particular context is a sch...
Affinity functions are the core components in negative selection to discriminate self from non-self. It has been shown that affinity functions such as the r-contiguous distance an...
— Metaheuristics such as Estimation of Distribution Algorithms and the Cross-Entropy method use probabilistic modelling and inference to generate candidate solutions in optimizat...
Marcus Gallagher, Ian Wood, Jonathan M. Keith, Geo...
Rather than painful, manual, static, per-connection optimization of TCP buffer sizes simply to achieve acceptable performance for distributed applications [8, 10], many researcher...
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...