{"id":"https://openalex.org/W28212458","doi":null,"title":"Efficient Methods for Asynchronous Distributed Constraint Optimization Algorithm.","display_name":"Efficient Methods for Asynchronous Distributed Constraint Optimization Algorithm.","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W28212458","mag":"28212458"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.408.7230","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.408.7230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.matlab.nitech.ac.jp/~matsuo/AIA05-1.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5008763368","display_name":"Toshihiro Matsui","orcid":"https://orcid.org/0000-0001-8557-8167","observed_orcids":["https://orcid.org/0000-0001-8557-8167"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Toshihiro Matsui","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-8557-8167","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039770030","display_name":"Hiroshi Matsuo","orcid":"https://orcid.org/0000-0003-3278-2484","observed_orcids":["https://orcid.org/0000-0003-3278-2484"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hiroshi Matsuo","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-3278-2484","affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"A. Iwata","orcid":"https://orcid.org/0009-0005-2045-6368","observed_orcids":["https://orcid.org/0009-0005-2045-6368"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Iwata","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0009-0005-2045-6368","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.00563219,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"727","last_page":"732"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":1.0,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":1.0,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":9.999999747378752e-05,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0,"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/distributed-constraint-optimization","display_name":"distributed constraint optimization","score":0.9319999814033508},{"id":"https://openalex.org/keywords/message-reduction","display_name":"message reduction","score":0.5860000252723694},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.7490000128746033},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"upper and lower bounds","score":0.6959999799728394},{"id":"https://openalex.org/keywords/search-efficiency","display_name":"search efficiency","score":0.5989999771118164}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.9127286076545715},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7204139828681946},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6603294014930725},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6546099185943604},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6428571343421936},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5704159140586853},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5687428712844849},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5226057171821594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4895969033241272},{"id":"https://openalex.org/C194036150","wikidata":"https://www.wikidata.org/wiki/Q4876196","display_name":"Beam stack search","level":5,"score":0.42195630073547363},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.307578980922699},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2957494854927063},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.07730734348297119},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.07698258757591248},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0665084719657898},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.408.7230","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.408.7230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.matlab.nitech.ac.jp/~matsuo/AIA05-1.pdf","raw_type":"text"},{"id":"mag:28212458","doi":null,"is_oa":false,"landing_page_url":"http://www.matlab.nitech.ac.jp/~matsuo/AIA05-1.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Artificial Intelligence and Applications","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1524794046","https://openalex.org/W1558184472","https://openalex.org/W1567278842","https://openalex.org/W2068886975","https://openalex.org/W2160458341","https://openalex.org/W2166086604","https://openalex.org/W2170125191","https://openalex.org/W2170789470","https://openalex.org/W2569549435","https://openalex.org/W2611247412","https://openalex.org/W3117513160"],"related_works":["https://openalex.org/W2112658016","https://openalex.org/W70326621","https://openalex.org/W4233313646","https://openalex.org/W2573377470","https://openalex.org/W7100609386","https://openalex.org/W7095156273","https://openalex.org/W7096058528","https://openalex.org/W2068360624","https://openalex.org/W1594489547","https://openalex.org/W2008759451"],"abstract_inverted_index":{"Effective":[0],"methods":[1],"to":[2,66,80],"reduce":[3,46,81],"number":[4],"of":[5,8,48,54,56,72,89],"message":[6],"cycles":[7],"adopt":[9],"algorithm":[10,15,25],"which":[11],"is":[12,78],"a":[13],"complete":[14],"for":[16],"distributed":[17],"constraint":[18],"optimization":[19],"problems":[20],"are":[21,59,64],"proposed.":[22],"The":[23,84],"Adopt":[24],"can":[26],"perform":[27],"branch":[28],"and":[29,39,51,61,75],"bound":[30,53,77],"search":[31],"asynchronously.":[32],"However,":[33],"it":[34],"has":[35],"overhead":[36,47],"in":[37],"backtracking":[38],"searches":[40],"same":[41],"partial":[42,57],"solution":[43,58],"repeatedly.":[44],"To":[45],"backtracking,":[49],"lower":[50,74],"upper":[52,67,76],"cost":[55],"considered":[60],"some":[62],"messages":[63],"sent":[65],"nodes":[68],"by":[69],"shortcut.":[70],"Leaning":[71],"the":[73,87,90],"used":[79],"extra":[82],"search.":[83],"results":[85],"show":[86],"efficiency":[88],"proposed":[91],"methods.":[92]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-09-29T14:09:16.559479","created_date":"2016-06-24T00:00:00"}