Show simple item record

dc.contributor.advisorMitra, Debasis
dc.contributor.authorLaunay, Florent
dc.contributor.authorMitra, Debasis
dc.date.accessioned2013-11-05T14:42:22Z
dc.date.available2013-11-05T14:42:22Z
dc.date.issued2002-12-02
dc.identifier.citationLaunay, F., Mitra, D. (2002). An optimum greedy algorithm for choosing minimal set of conflicting constraints in the point sequencing problem (CS-2002-15). Melbourne, FL. Florida Institute of Technology.en_US
dc.identifier.otherCS-2002-15
dc.identifier.urihttp://hdl.handle.net/11141/107
dc.description.abstractIn this work, we first have proposed a technique to define the "causes" of inconsistency on an online point based reasoning constraint network. Second, we introduce an algorithm that proposes the user a minimal set of relations to remove when inconsistencies are detected. We have developed and implemented a battery of algorithms for the purpose of this type of reasoning. Some useful theorems and properties are defined for proving the 'minimal' aspect of the algorithm. Finally, we found that our investigation was a polynomially solvable sub problem of the vertex cover problem.en_US
dc.language.isoen_USen_US
dc.rightsCopyright held by authors.en_US
dc.titleAn optimum greedy algorithm for choosing minimal set of conflicting constraints in the point sequencing problemen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record