JSAT 2008 - PDF Preprint Papers

JSAT 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JSAT-2008 Paper

click to vote

JSAT
2008

122views more JSAT 2008»

SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results

13 years 5 months ago

Download jsat.ewi.tudelft.nl

The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...

Sriyankar Acharyya

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	122	SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results	claim
2	113	Combining Adaptive and Dynamic Local Search for Satisfiability	claim
3	99	A Switching Criterion for Intensification and Diversification in Local Search for SAT	claim
4	90	2006 and 2007 Max-SAT Evaluations: Contributed Instances	claim
5	89	Towards a Classification of Hamiltonian Cycles in the 6-Cube	claim
6	85	Parallel SAT Solving using Bit-level Operations	claim
7	83	The First and Second Max-SAT Evaluations	claim
8	80	Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis	claim
9	79	An Extended Semidefinite Relaxation for Satisfiability	claim
10	79	PicoSAT Essentials	claim
11	63	Whose side are you on? Finding solutions in a biased search-tree	claim
12	57	tts: A SAT-Solver for Small, Difficult Instances	claim
13	53	Guest Editors Conclusion	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers