D. Sam, Constraint consistency techniques for continuous domains, PhD Thesis, EPFL Lausanne, 1995  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of domains (intervals) for the variables occurring in the constraints, their output is a set o of boxes approximating each solution contained in the input box. However, soundness is not guaranteed while it is sometimes a strong requirement. Consider, for instance, a civil engineering problem [20] such as floor design where retaining non solution points may lead to a physically unfeasible structure. As pointed out by Ward et al. 25] and Shary [23] one may expect di#erent properties from the boxes composing o depending on the problem at hand, namely: every element in any box is a ....

....By contrast, CAD based methods deal with polynomial constraints only. However, constraints to be handled by our algorithm need be easily negated, a requirement trivially met with inequalities but not with equalities. The handling of equalities might be done as described by Sam Haroud and Faltings [21, 20] Table 2. EIA4(#) vs. ICAb5 All solutions Benchmark EIA4 ICAb5 EIA4 ICAb5 Projection3,5 783.03 68.83 11.38 Projection3,10 9,000 3,634 2476.61 Projection5,5 9,000 3,612 2491.69 School Problem3,1 156.02 12.72 12.27 Flying Saucer4,1 1,459.01 1,078.03 1.35 Simple Circle2,1 12,789.03 ....

J. Sam. Constraint Consistency Techniques for Continuous Domains. Phd. thesis, Ecole polytechnique federale de Lausanne, 1995.

....of domains (intervals) for the variables occurring in the constraints, their output is a set o of boxes approximating each solution contained in the input box. However, soundness is not guaranteed while it is sometimes a strong requirement. Consider, for instance, a civil engineering problem [33] such as floor design where retaining non solution points may lead to a physically unfeasible structure. As pointed out by Ward et al. 43] and Shary [37] one may expect different properties from the boxes composing o depending on the problem at hand, namely : every element in any box is a ....

....as is the case with the method based on Bernstein expansion [19] However, constraints to be handled by our algorithm need be easily negated, a requirement trivially met with inequalities but not with equalities. The handling of equalities might be done as described by Sam Haroud and Faltings [34, 33] by relaxing the requirement f = 0 into f = thus replacing an equality by two inequalities. Despite the dramatic improvement of the new method described herein over the one given by Jardillier and Langunou, handling of complex scenes with many objects and a camera allowed to move along all its ....

Jamila SAM. Constraint Consistency Techniques for Continuous Domains. Phd. thesis, cole polytechnique fdrale de Lausanne, ####.

....before in other contexts. Firstly, a group of solutions is naturally more robust than a single solution and so has is useful for problems with uncertainty [7] Secondly, in problems with continuous variables then solutions are described by interval constraints on variables rather than equalities [13, 12, 1] and so solutions are naturally groups of solutions rather akin to a pure cluster, but containing an infinite number of distinct models. Possibly our work on impure clusters and distributed search is also applicable to numerical CSPs, or could benefit from the existing work in that area. 6. ....

Djamila Sam-Haroud. Constraint consistency techniques for continuous domains. PhD thesis, Federal Institute of Technology, Lausanne, Switzerland, 1995.

....space on these criteria supports good decision making. 4.3 SpaceSolver an Internet based CSP tool set SpaceSolver is a constraint solver for continuous CSPs based on the Internet. It provides extensions for collaboration. The constraint satisfaction techniques applied are best described in (Sam Haroud, 1995, SamHaroud and Faltings, 1996) It provides an interface to the Web and is therefore well adapted to implement the collaborative design approach presented here. Its use involves a solving process in four phases: Specify parameters and constraints . Perform an algebraic reformulation into ....

Sam-Haroud D. (1995). Constraint consistency techniques for continuous domains, PhD thesis No. 1423, Swiss Federal Institute of Technology in Lausanne, Switzerland.

No context found.

D. Sam, Constraint consistency techniques for continuous domains, PhD Thesis, EPFL Lausanne, 1995

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC