{"id":"https://openalex.org/W2087759648","doi":"https://doi.org/10.1109/hpcs.2010.5547119","title":"Portfolio-based Parallel SAT solving","display_name":"Portfolio-based Parallel SAT solving","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2087759648","doi":"https://doi.org/10.1109/hpcs.2010.5547119","mag":"2087759648"},"language":"en","primary_location":{"id":"doi:10.1109/hpcs.2010.5547119","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs.2010.5547119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Conference on High Performance Computing &amp; Simulation","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/A5037137798","display_name":"Lakhdar Sa\u00efs","orcid":"https://orcid.org/0000-0003-2879-8627"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I59807433","display_name":"Universit\u00e9 Lille Nord de France","ror":"https://ror.org/03btvgn05","country_code":"FR","type":"education","lineage":["https://openalex.org/I59807433"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Lakhdar Sais","raw_affiliation_strings":["CRIL - CNRS UMR 8188, Universit\u00e9 Lille Nord de, France","CRIL, CNRS UMR 8188, Universit\u00e9 Lille Nord De, France"],"affiliations":[{"raw_affiliation_string":"CRIL - CNRS UMR 8188, Universit\u00e9 Lille Nord de, France","institution_ids":["https://openalex.org/I59807433","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"CRIL, CNRS UMR 8188, Universit\u00e9 Lille Nord De, France","institution_ids":["https://openalex.org/I59807433","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037137798"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I59807433"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12558072,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"331","last_page":"331"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9937000274658203,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8376627564430237},{"id":"https://openalex.org/keywords/portfolio","display_name":"Portfolio","score":0.7325780391693115},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.6633043885231018},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5054516792297363},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40287429094314575},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1922653317451477}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8376627564430237},{"id":"https://openalex.org/C2780821815","wikidata":"https://www.wikidata.org/wiki/Q5340806","display_name":"Portfolio","level":2,"score":0.7325780391693115},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.6633043885231018},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5054516792297363},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40287429094314575},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1922653317451477},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcs.2010.5547119","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcs.2010.5547119","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Conference on High Performance Computing &amp; Simulation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1485898611","https://openalex.org/W1566044003","https://openalex.org/W2039027656","https://openalex.org/W2046612382","https://openalex.org/W2061156579","https://openalex.org/W2079547519","https://openalex.org/W2092775861","https://openalex.org/W2103406309","https://openalex.org/W2123098314","https://openalex.org/W2129807688","https://openalex.org/W6660393537"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2352794675","https://openalex.org/W1539994214","https://openalex.org/W2051228988","https://openalex.org/W4247094814","https://openalex.org/W108531593","https://openalex.org/W2111712077","https://openalex.org/W8810113","https://openalex.org/W2340701376"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2],"given.":[3],"In":[4],"this":[5],"talk":[6],"we":[7,16,27,41,48,64],"present":[8],"several":[9],"contributions":[10],"to":[11],"Parallel":[12],"SAT":[13],"solving.":[14],"First,":[15],"overview":[17],"some":[18],"of":[19],"the":[20,29,43,56,60,66,73],"recent":[21],"work":[22],"on":[23],"parallel":[24,31,71,81],"SAT,":[25],"then":[26],"introduce":[28],"portfolio-based":[30],"framework":[32],"and":[33,38,47,76,78],"discuss":[34],"its":[35],"main":[36,68],"pros.":[37],"cons.":[39],"Secondly,":[40],"address":[42],"clause":[44],"sharing":[45],"issue,":[46],"describe":[49],"a":[50],"novel":[51],"approach":[52],"for":[53,70],"dynamically":[54],"controlling":[55],"overall":[57],"exchange":[58],"between":[59],"computing":[61],"units.":[62],"Finally,":[63],"compare":[65],"two":[67],"approaches":[69],"SAT:":[72],"classical":[74],"divide":[75],"conquer":[77],"portfolio":[79],"based":[80],"models.":[82]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
