{"id":"https://openalex.org/W4283276547","doi":"https://doi.org/10.1109/meco55406.2022.9797220","title":"Interval Constraint Satisfaction: Towards Edge Acceleration","display_name":"Interval Constraint Satisfaction: Towards Edge Acceleration","publication_year":2022,"publication_date":"2022-06-07","ids":{"openalex":"https://openalex.org/W4283276547","doi":"https://doi.org/10.1109/meco55406.2022.9797220"},"language":"en","primary_location":{"id":"doi:10.1109/meco55406.2022.9797220","is_oa":false,"landing_page_url":"https://doi.org/10.1109/meco55406.2022.9797220","pdf_url":null,"source":{"id":"https://openalex.org/S4363608204","display_name":"2022 11th Mediterranean Conference on Embedded Computing (MECO)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 11th Mediterranean Conference on Embedded Computing (MECO)","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/A5110402596","display_name":"Jiri Khun","orcid":null},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jiri Khun","raw_affiliation_strings":["Czech Technical University in Prague,Faculty of Information Technology,Department of Digital Design,Praha,Czech Republic,160 00"],"affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague,Faculty of Information Technology,Department of Digital Design,Praha,Czech Republic,160 00","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042494873","display_name":"Jan Schmidt","orcid":"https://orcid.org/0000-0002-4851-4452"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Schmidt","raw_affiliation_strings":["Czech Technical University in Prague,Faculty of Information Technology,Department of Digital Design,Praha,Czech Republic,160 00"],"affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague,Faculty of Information Technology,Department of Digital Design,Praha,Czech Republic,160 00","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110402596"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.2162,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.27600111,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9937999844551086,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.830431342124939},{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.8126857280731201},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.8043334484100342},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.7060633897781372},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.6632803082466125},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6544840335845947},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.6313847899436951},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5974863171577454},{"id":"https://openalex.org/keywords/constraint-satisfaction-dual-problem","display_name":"Constraint satisfaction dual problem","score":0.5961677432060242},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5586557388305664},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5537807941436768},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.5182230472564697},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36942949891090393},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3683582544326782},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2943001389503479},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22424852848052979},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.10794544219970703},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0680854320526123},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06711778044700623}],"concepts":[{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.830431342124939},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.8126857280731201},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.8043334484100342},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.7060633897781372},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.6632803082466125},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6544840335845947},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.6313847899436951},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5974863171577454},{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.5961677432060242},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5586557388305664},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5537807941436768},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.5182230472564697},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36942949891090393},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3683582544326782},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2943001389503479},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22424852848052979},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.10794544219970703},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0680854320526123},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06711778044700623},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/meco55406.2022.9797220","is_oa":false,"landing_page_url":"https://doi.org/10.1109/meco55406.2022.9797220","pdf_url":null,"source":{"id":"https://openalex.org/S4363608204","display_name":"2022 11th Mediterranean Conference on Embedded Computing (MECO)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 11th Mediterranean Conference on Embedded Computing (MECO)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3861242453","display_name":null,"funder_award_id":"SGS20/211/OHK3/3T/18","funder_id":"https://openalex.org/F4320309972","funder_display_name":"\u010cesk\u00e9 Vysok\u00e9 U\u010den\u00ed Technick\u00e9 v Praze"}],"funders":[{"id":"https://openalex.org/F4320309972","display_name":"\u010cesk\u00e9 Vysok\u00e9 U\u010den\u00ed Technick\u00e9 v Praze","ror":"https://ror.org/03kqpb082"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1482694871","https://openalex.org/W1507872748","https://openalex.org/W1588693185","https://openalex.org/W1713767473","https://openalex.org/W2004216287","https://openalex.org/W2025974163","https://openalex.org/W2101574317","https://openalex.org/W2152817729","https://openalex.org/W2426452510","https://openalex.org/W2963180166","https://openalex.org/W3015998244","https://openalex.org/W6635220200"],"related_works":["https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W1550482496","https://openalex.org/W2141935412","https://openalex.org/W2737098235","https://openalex.org/W2012141606","https://openalex.org/W2012694101","https://openalex.org/W2161128834","https://openalex.org/W96881443"],"abstract_inverted_index":{"Interval":[0],"constraint":[1],"satisfaction":[2],"problems":[3],"(CSPs)":[4],"are":[5],"typically":[6],"hard":[7],"to":[8,62],"solve":[9],"and,":[10],"therefore,":[11],"desirable":[12],"candidates":[13],"for":[14,41,75],"acceleration.":[15],"Although":[16],"there":[17],"were":[18],"successful":[19],"attempts":[20],"in":[21],"this":[22],"area,":[23],"several":[24,54],"paths":[25],"remain":[26],"unexplored.":[27],"Let's":[28],"describe,":[29],"discuss,":[30],"and":[31,38,66],"generalize":[32],"our":[33],"findings":[34],"among":[35,68],"partial":[36],"algorithms":[37],"approaches":[39],"used":[40],"interval":[42,49],"CSP":[43,50],"solving.":[44],"We":[45,58],"have":[46],"divided":[47],"the":[48],"solving":[51],"process":[52],"into":[53],"levels":[55],"of":[56],"abstraction.":[57],"analyzed":[59],"them":[60],"individually":[61],"find":[63],"common":[64],"traits":[65],"patterns":[67],"them.":[69],"These":[70],"can":[71],"indicate":[72],"possible":[73],"areas":[74],"future":[76],"acceleration":[77],"attempts,":[78],"especially":[79],"on":[80],"edge":[81],"systems":[82],"where":[83],"effectiveness":[84],"plays":[85],"an":[86],"important":[87],"role.":[88]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}