• DocumentCode
    292366
  • Title

    Disjunctive constraint satisfaction over reals

  • Author

    Gaur, Daya Ram ; Havens, William S.

  • Author_Institution
    Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada
  • Volume
    1
  • fYear
    1993
  • fDate
    19-21 May 1993
  • Firstpage
    17
  • Abstract
    Optimal algorithms are given for the disjunctive constraint satisfaction problem when the dimensions are two and three. These algorithms are based on techniques frequently used in computational geometry. The running times of the algorithms are O(n 2) and O(n3) in two and three dimensions, respectively
  • Keywords
    computational complexity; computational geometry; constraint handling; expert systems; computational geometry; disjunctive constraint satisfaction problem; optimal algorithms; running times; Computational geometry; Ear; Linear programming; Logic programming; Partitioning algorithms; Polynomials; Postal services;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, Computers and Signal Processing, 1993., IEEE Pacific Rim Conference on
  • Conference_Location
    Victoria, BC
  • Print_ISBN
    0-7803-0971-5
  • Type

    conf

  • DOI
    10.1109/PACRIM.1993.407230
  • Filename
    407230
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=292366