M. M. M. C. C. Yang and F. W. Ciarallo, "Constraint networks with integer, real, and interval values for robotics and mechanical design," Applied Artificial Intelligence, 1997. submitted.  Home/Search   Document Not in Database   Summary   Related Articles

....found. 2.8 Interval Constraint Satisfaction Problems Interval constraint satisfaction problem (ICSP) is a constraint satisfaction problem with the domain of variable as interval. Each variable is assigned an interval instead of a single value. Some have investigated the domain of real intervals [31, 32, 33, 34, 35, 36], and some have investigated the domain of set of discrete values [37, 18] Some have examined the binary constraints [37, 33] and some have examined the n ary mathematical constraints [31, 32, 18, 35, 35, 36] Dechter and Pearl [14] developed a method of generating heuristic advice to guide the ....

....interval instead of a single value. Some have investigated the domain of real intervals [31, 32, 33, 34, 35, 36] and some have investigated the domain of set of discrete values [37, 18] Some have examined the binary constraints [37, 33] and some have examined the n ary mathematical constraints [31, 32, 18, 35, 35, 36]. Dechter and Pearl [14] developed a method of generating heuristic advice to guide the order of value assignments based on sparseness in the constraint network and the simplicity of tree structured CSPs. The domains of variables are sets of discrete values and the constraints. The approach of ....

M. M. M. C. C. Yang and F. W. Ciarallo, "Constraint networks with integer, real, and interval values for robotics and mechanical design," Applied Artificial Intelligence, 1997. submitted.

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