loading...
A Time-Space Trade-Off for Constraint Networks Decomposition
Boca Raton, Florida November 15-November 17
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICTAI.2004.2116th IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Philippe Jégou, Université déAix-Marseille 3
Cyril Terrioux, Université déAix-Marseille 3
We study here a CSP decomposition method introduced in [9] and called Cyclic-Clustering. While [9] only presents the principles of the method, this paper explains how this method can be made operational by exploiting good properties of triangulated induced subgraphs. After, we give formal results which show that Cyclic-Clustering proposes a time-space trade-off w.r.t. theoretical complexities. Finally, we present some preliminary experiments which show that Cyclic-Clustering may be efficient in practice.
Citation:
Philippe Jégou, Cyril Terrioux, "A Time-Space Trade-Off for Constraint Networks Decomposition," ictai, pp.234-239, 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.