1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/474
DC FieldValueLanguage
dc.contributor.authorNikolić, Mladenen_US
dc.date.accessioned2022-08-13T09:51:51Z-
dc.date.available2022-08-13T09:51:51Z-
dc.date.issued2010-08-02-
dc.identifier.isbn3642141854-
dc.identifier.issn03029743en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/474-
dc.description.abstractEvaluating improvements to modern SAT solvers and comparison of two arbitrary solvers is a challenging and important task. Relative performance of two solvers is usually assessed by running them on a set of SAT instances and comparing the number of solved instances and their running time in a straightforward manner. In this paper we point to shortcomings of this approach and advocate more reliable, statistically founded methodologies that could discriminate better between good and bad ideas. We present one such methodology and illustrate its application. © 2010 Springer-Verlag.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_US
dc.titleStatistical methodology for comparison of SAT solversen_US
dc.typeConference Objecten_US
dc.relation.conferenceInternational Conference on Theory and Applications of Satisfiability Testing - SAT 2010 (13 ; 2010 ; Edinburgh)en_US
dc.relation.publicationTheory and Applications of Satisfiability Testing SAT 2010 : 13th International Conferenceen_US
dc.identifier.doi10.1007/978-3-642-14186-7_18-
dc.identifier.scopus2-s2.0-77954964146-
dc.identifier.isi000281446500018-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/77954964146-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.isbn978-3-642-14185-0en_US
dc.relation.doi10.1007/978-3-642-14186-7en_US
dc.relation.issn0302-9743en_US
dc.description.rankM33en_US
dc.relation.firstpage209en_US
dc.relation.lastpage222en_US
dc.relation.volume6175 LNCSen_US
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.openairetypeConference Object-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0009-0002-8943-2709-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

5
checked on Nov 25, 2025

Page view(s)

18
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.