Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
In this paper, we present a new approach to producing photorealistic computer renderings of real architectural scenes under novel lighting conditions, such as at different times o...
: In computer-aided design, geometric modeling by constraints enables users to describe shapes by relationships called constraints between geometric elements. The problem is to der...
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
act 12 This paper describes a new placement method based on pattern matching for 2D tiling problems. Tiling problem can be 13 considered as a special case of bin packing. In the pr...
Mahmood Amintoosi, Hadi Sadoghi Yazdi, Mahmood Fat...