{"id":"https://openalex.org/W2107253255","doi":"https://doi.org/10.1109/isqed.2009.4810323","title":"Efficient SAT-based techniques for Design of Experiments by using static variable ordering","display_name":"Efficient SAT-based techniques for Design of Experiments by using static variable ordering","publication_year":2009,"publication_date":"2009-03-01","ids":{"openalex":"https://openalex.org/W2107253255","doi":"https://doi.org/10.1109/isqed.2009.4810323","mag":"2107253255"},"language":"en","primary_location":{"id":"doi:10.1109/isqed.2009.4810323","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isqed.2009.4810323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 10th International Symposium on Quality of Electronic Design","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030659202","display_name":"Miroslav N. Velev","orcid":"https://orcid.org/0000-0001-7775-5186"},"institutions":[{"id":"https://openalex.org/I4210135261","display_name":"Aries Design Automation (United States)","ror":"https://ror.org/045fe0126","country_code":"US","type":"company","lineage":["https://openalex.org/I4210135261"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Miroslav N. Velev","raw_affiliation_strings":["Aries Design Automation, LLC, USA"],"affiliations":[{"raw_affiliation_string":"Aries Design Automation, LLC, USA","institution_ids":["https://openalex.org/I4210135261"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101168953","display_name":"Ping Gao","orcid":null},"institutions":[{"id":"https://openalex.org/I4210135261","display_name":"Aries Design Automation (United States)","ror":"https://ror.org/045fe0126","country_code":"US","type":"company","lineage":["https://openalex.org/I4210135261"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ping Gao","raw_affiliation_strings":["Aries Design Automation, LLC, USA"],"affiliations":[{"raw_affiliation_string":"Aries Design Automation, LLC, USA","institution_ids":["https://openalex.org/I4210135261"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030659202"],"corresponding_institution_ids":["https://openalex.org/I4210135261"],"apc_list":null,"apc_paid":null,"fwci":1.7139,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.84528408,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3569","issue":null,"first_page":"371","last_page":"376"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9829999804496765,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8522616624832153},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6780457496643066},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6672698259353638},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5849055051803589},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5818403363227844},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5519461631774902},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5143040418624878},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4880741834640503},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46964213252067566},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40091246366500854},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.323408305644989},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3067207336425781},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28806501626968384},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09922659397125244},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07503846287727356}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8522616624832153},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6780457496643066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6672698259353638},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5849055051803589},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5818403363227844},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5519461631774902},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5143040418624878},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4880741834640503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46964213252067566},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40091246366500854},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.323408305644989},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3067207336425781},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28806501626968384},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09922659397125244},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07503846287727356},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isqed.2009.4810323","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isqed.2009.4810323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 10th International Symposium on Quality of Electronic Design","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W4907163","https://openalex.org/W5547553","https://openalex.org/W123065924","https://openalex.org/W191436643","https://openalex.org/W1551913526","https://openalex.org/W1556130451","https://openalex.org/W1567600461","https://openalex.org/W1571122520","https://openalex.org/W1572277334","https://openalex.org/W1577460141","https://openalex.org/W1580199978","https://openalex.org/W1584491303","https://openalex.org/W1594003384","https://openalex.org/W1634413251","https://openalex.org/W1667362966","https://openalex.org/W1821775247","https://openalex.org/W1969722953","https://openalex.org/W1973898358","https://openalex.org/W2033937366","https://openalex.org/W2047619809","https://openalex.org/W2057350245","https://openalex.org/W2060135116","https://openalex.org/W2067490780","https://openalex.org/W2075959177","https://openalex.org/W2078543326","https://openalex.org/W2083140445","https://openalex.org/W2102016680","https://openalex.org/W2112874857","https://openalex.org/W2139907818","https://openalex.org/W2142785340","https://openalex.org/W2145063882","https://openalex.org/W2150956839","https://openalex.org/W2164322797","https://openalex.org/W2401471087","https://openalex.org/W2789952880","https://openalex.org/W2914775474","https://openalex.org/W3100538812","https://openalex.org/W4247585869","https://openalex.org/W4285719527","https://openalex.org/W6605025763","https://openalex.org/W6633157832","https://openalex.org/W6634300341","https://openalex.org/W6638622294","https://openalex.org/W6670243253","https://openalex.org/W6676977751","https://openalex.org/W6683869205","https://openalex.org/W6712783631"],"related_works":["https://openalex.org/W4386614288","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287","https://openalex.org/W2014111643","https://openalex.org/W2963044240","https://openalex.org/W2076399409"],"abstract_inverted_index":{"Design":[0],"of":[1,12,19,26,58,91,114,122,128,152,160,197,209,218,227,232],"experiments":[2],"(DOE)":[3],"is":[4,80,98],"an":[5,194],"important":[6],"problem":[7,47],"for":[8,55],"ensuring":[9],"the":[10,17,74,101,115,123,129,132,135,144,153,177,184,200,206,215],"quality":[11],"EDA":[13],"with":[14,88,100,199,205,214],"applications":[15],"to":[16,62,72,96,176,229],"evaluation":[18],"techniques":[20],"and":[21,30,36,51,66,85,104,120,138,149,158,222],"tools":[22],"in":[23,166,171,183],"all":[24],"sub-fields":[25],"EDA,":[27],"e.g.,":[28],"yield":[29],"variability":[31],"optimization,":[32],"error":[33],"correcting":[34],"codes,":[35],"software":[37],"testing.":[38],"DOE":[39],"can":[40,163],"be":[41,164],"formulated":[42],"as":[43],"a":[44,172],"quasigroup":[45],"completion":[46],"(QCP).":[48],"We":[49],"propose":[50],"compare":[52],"23":[53,124],"heuristics":[54,161,191],"efficient":[56,155],"solving":[57],"QCPs":[59],"by":[60,108],"translation":[61,95],"Boolean":[63,69],"satisfiability":[64],"(SAT)":[65],"exploiting":[67],"static":[68,145,189],"variable":[70,146,180],"ordering":[71,147,181],"solve":[73],"resulting":[75],"SAT":[76,97,185],"formulas.":[77],"This":[78],"comparison":[79,121],"based":[81],"on":[82,168,224],"both":[83],"satisfiable":[84],"unsatisfiable":[86],"instances":[87],"varying":[89],"numbers":[90],"empty":[92],"cells.":[93],"The":[94,112],"done":[99],"minimal":[102],"(2-D)":[103],"extended":[105],"(3-D)":[106],"encodings":[107],"Kautz":[109],"et":[110],"al.":[111],"contributions":[113],"paper":[116],"include:":[117],"1)":[118],"proposal":[119],"heuristics;":[125,148],"2)":[126],"study":[127],"benefits":[130],"from":[131,139],"3-D":[133],"vs.":[134],"2-D":[136],"encoding,":[137],"local":[140],"symmetry-breaking":[141],"constraints,":[142],"given":[143],"3)":[150],"identification":[151],"most":[154],"single":[156,201],"heuristic,":[157,203],"portfolios":[159],"that":[162],"run":[165],"parallel":[167,211,220],"multiple":[169],"cores":[170],"modern":[173],"CPU.":[174],"Compared":[175],"default":[178],"dynamic":[179],"heuristic":[182],"solver,":[186],"when":[187],"using":[188],"variable-ordering":[190],"we":[192],"achieve":[193],"average":[195],"speedup":[196],"2.8times":[198],"best":[202,207,216],"7.2times":[204],"portfolio":[208,217],"two":[210],"heuristics,":[212,221],"13.6times":[213],"four":[219],"speedups":[223],"individual":[225],"benchmarks":[226],"up":[228],"3":[230],"orders":[231],"magnitude.":[233]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}