Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
In this paper, we address the problem of color image restoration. Here, we model the image as a Markov Random Field (MRF) and propose a restoration algorithm in a multiresolution ...
P. K. Nanda, K. Sunil Kumar, S. Ghokale, Uday B. D...
—We consider the problem of joint rate scheduling and lossy data compression in a two-way relay network with distortion-sensitive stochastic packet traffic. A relay node facilit...
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
The deterministic Multi-step Crossover Fusion (dMSXF) is an improved crossover method of MSXF which is a promising method of JSP, and it shows high availability in TSP. Both of th...