Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
A Branching Heuristics for Quantified Renamable Horn Formula...
Sort
relevance
views
votes
recent
update
View
thumb
title
29
click to vote
SAT
2005
Springer
117
views
Hardware
»
more
SAT 2005
»
A Branching Heuristics for Quantified Renamable Horn Formulas
14 years 4 months ago
Download
users.ecs.soton.ac.uk
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...
claim paper
Read More »
30
click to vote
ICTAI
2006
IEEE
109
views
Artificial Intelligence
»
more
ICTAI 2006
»
Computing Horn Strong Backdoor Sets Thanks to Local Search
14 years 4 months ago
Download
www.cril.univ-artois.fr
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
Lionel Paris, Richard Ostrowski, Pierre Siegel, La...
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »