Sciweavers

5622 search results - page 92 / 1125
» Solving architectural modelling problems using knowledge
Sort
View
102
Voted
CP
2003
Springer
15 years 7 months ago
Redundant Modeling for the QuasiGroup Completion Problem
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...
Iván Dotú, Alvaro del Val, Manuel Ce...
109
Voted
SIGGRAPH
1998
ACM
15 years 6 months ago
Recovering Photometric Properties of Architectural Scenes from Photographs
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...
Yizhou Yu, Jitendra Malik
IV
2002
IEEE
124views Visualization» more  IV 2002»
15 years 7 months ago
Numerical Solving of Geometric Constraints
: 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...
Samy Ait-Aoudia
126
Voted
SPIRE
2010
Springer
15 years 1 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
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...
Christina Boucher, Kathleen Wilkie
EOR
2007
97views more  EOR 2007»
15 years 2 months ago
Using pattern matching for tiling and packing problems
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...