This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
Recursive partitioning based placement has a long history, but there has been little consensus on how cut sequences should be chosen. In this paper, we present a dynamic programmi...
—The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic feature...
This paper presents a 3D face recognition system based on geometrically localized facial features. We propose the feature extraction procedure using the geometrical characteristics...
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
Abstract. Constraint programming based column generation is a hybrid optimization framework recently proposed that uses constraint programming (CP) to solve column generation subpr...