The construction of good, finite-length, LDPC codes is currently an attractive research area. Reducing attention to the Binary Erasure Channel (BEC), this problem translates into t...
Dejan Vukobratovic, Aleksandar Djurendic, Vojin Se...
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
We consider the problem of robustly and accurately locating facial features. The relative positions of different feature points are represented using a statistical shape model. We...
Regressions has successfully been incorporated into memetic algorithm (MA) to build surrogate models for the objective or constraint landscape of optimization problems. This helps ...
Stephanus Daniel Handoko, Chee Keong Kwoh, Yew-Soo...