A Comparison between SAT and CSP Techniques

ISSN： 1383-7133

Source： Constraints, Vol.9, Iss.2, 2004-04, pp. : 123-138

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the hardness of solving edge matching puzzles as SAT or CSP problems

By Ansótegui Carlos

Constraints, Vol. 18, Iss. 1, 2013-01 ,pp. : 7-37

Springer Publishing Company

Access to resources Recommend Favorite

Theoretical comparison between sequential redundancy addition and removal and retiming optimization techniques

By San Millan E. Entrena L. Espejo J.A. Lopez C.

Journal of Systems Architecture, Vol. 49, Iss. 12, 2003-12 ,pp. : 529-541

Elsevier

Access to resources Recommend Favorite

Approximations and Randomization to Boost CSP Techniques: Hybrid Optimization Techniques (Editors: Narendra Jussien and François Laburthe)

By Gomes Carla P.

Annals of Operations Research, Vol. 130, Iss. 1-4, 2004-08 ,pp. : 117-141

Springer Publishing Company

Access to resources Recommend Favorite

Exp1: a comparison between a simple adaptive caching agent using document life histories and existing cache techniques

By Reddy M. Fletcher G.P.

Computer Networks and ISDN Systems, Vol. 30, Iss. 22, 1998-11 ,pp. : 2149-2153

Elsevier

Access to resources Recommend Favorite

A Comparison of Techniques for Rendering Scenes

By Moroney Nathan Tastl Ingeborg

Color and Imaging Conference, Vol. 2002, Iss. 1, 2002-01 ,pp. : 208-211

Society for Imaging Science and Technology

Access to resources Recommend Favorite