{"id":"https://openalex.org/W2154367227","doi":"https://doi.org/10.1145/162754.162902","title":"Asynchronous organizations for multi-algorithm problems","display_name":"Asynchronous organizations for multi-algorithm problems","alternate_titles":[],"publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W2154367227","doi":"https://doi.org/10.1145/162754.162902","mag":"2154367227"},"language":"en","primary_location":{"id":"doi:10.1145/162754.162902","doi":"https://doi.org/10.1145/162754.162902","is_oa":false,"landing_page_url":"https://doi.org/10.1145/162754.162902","pdf_url":null,"source":{"id":"https://openalex.org/S4306417581","display_name":"ACM Symposium on Applied Computing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing states of the art and practice - SAC '93","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2154367227"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5090374266","display_name":"Pedro S. de Souza","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pedro S. de Souza","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5112775114","display_name":"Sarosh Talukdar","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sarosh N. Talukdar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.6552,"has_fulltext":false,"cited_by_count":89,"citation_normalized_percentile":{"value":0.95962994,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":86,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"286","last_page":"293"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.8208000063896179,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.8208000063896179,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.03779999911785126,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.022099999710917473,"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/algorithm-combination","display_name":"algorithm combination","score":0.7459999918937683},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.7310000061988831},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9269999861717224},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"multi-objective optimization","score":0.5809999704360962},{"id":"https://openalex.org/keywords/asynchronous-agents","display_name":"asynchronous agents","score":0.4399999976158142},{"id":"https://openalex.org/keywords/shared-memory","display_name":"shared memory","score":0.7369999885559082},{"id":"https://openalex.org/keywords/parallel-execution","display_name":"parallel execution","score":0.6349999904632568},{"id":"https://openalex.org/keywords/speedup","display_name":"speedup","score":0.5370000004768372},{"id":"https://openalex.org/keywords/scale-efficiency","display_name":"scale efficiency","score":0.7519999742507935},{"id":"https://openalex.org/keywords/markov-model","display_name":"Markov model","score":0.8040000200271606},{"id":"https://openalex.org/keywords/convergence","display_name":"convergence","score":0.4620000123977661},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.4959999918937683}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.8584785461425781},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8024433851242065},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.6398507356643677},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5648053884506226},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5232126712799072},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4660089612007141},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32387447357177734},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17806866765022278},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/162754.162902","doi":"https://doi.org/10.1145/162754.162902","is_oa":false,"landing_page_url":"https://doi.org/10.1145/162754.162902","pdf_url":null,"source":{"id":"https://openalex.org/S4306417581","display_name":"ACM Symposium on Applied Computing","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing states of the art and practice - SAC '93","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W200750156","https://openalex.org/W204316863","https://openalex.org/W1528149415","https://openalex.org/W1546457065","https://openalex.org/W1992928037","https://openalex.org/W2009803313","https://openalex.org/W2036265926","https://openalex.org/W2090963365","https://openalex.org/W2167469500","https://openalex.org/W2753176400"],"related_works":["https://openalex.org/W146321095","https://openalex.org/W2150623658","https://openalex.org/W2381850","https://openalex.org/W1585155419","https://openalex.org/W7043765081","https://openalex.org/W2082461764","https://openalex.org/W2979337608","https://openalex.org/W1577119746","https://openalex.org/W2185796037"],"abstract_inverted_index":{"A":[0],"Multi-Algorithm":[1],"Problem":[2,137],"(MAP)":[3],"is":[4,140],"a":[5,32,51,59,86,126,141,160,187,280],"problem":[6,144],"with":[7,29,159],"many":[8,108,147],"approximate":[9,153],"algorithms":[10,68,109,149,162,177,210,270],"available":[11,48],"to":[12,39,57,71,112,165,246,271],"solve":[13,40],"it.":[14,156],"Examples":[15],"of":[16,20,65,74,125,133,183,255,261,302,309,313],"MAPs":[17],"are":[18,203],"most":[19],"the":[21,26,63,130,134,171,208,215,253,259,287],"combinatorial":[22,143],"optimization":[23],"problems":[24,28],"and":[25,46,95,145,220,231,237,252,311],"multi-criterion":[27],"conflicting":[30],"objectives.\r\nSince":[31],"MAP":[33,52],"has":[34,53,146],"no":[35],"single":[36],"algorithm":[37,49,118],"able":[38,164],"it":[41,217],"optimally":[42],"in":[43,69,110,275,292],"reasonable":[44],"time,":[45],"each":[47,117],"for":[50,155,169,200,225],"its":[54],"own":[55],"approach":[56],"solving":[58,201],"problem,":[60],"there":[61],"exists":[62],"possibility":[64],"combining":[66],"these":[67],"order":[70,111],"take":[72],"advantage":[73],"their":[75],"strengths.":[76],"This":[77],"thesis":[78],"demonstrates":[79],"that":[80,150,197,206,283],"by":[81,90,121,296],"using":[82],"an":[83,123,211],"Asynchronous":[84,157,184,198,212,226,262,276,294,314],"Team,":[85],"software":[87],"organization":[88],"characterized":[89],"cyclic,":[91],"iterative":[92],"data":[93,239,256],"flow":[94],"autonomous":[96],"agents":[97,235],"which":[98,139],"communicate":[99],"asynchronously":[100],"through":[101],"shared":[102,241,248],"memories,":[103],"one":[104],"can":[105,119],"synergistically":[106],"combine":[107],"reach":[113,166],"better":[114,216],"results":[115],"than":[116],"do":[120],"itself.\r\nAs":[122],"example":[124],"MAP,":[127],"we":[128,278],"chose":[129],"Euclidean":[131],"version":[132],"Traveling":[135],"Salesman":[136],"(TSP),":[138],"difficult":[142],"heuristic":[148],"only":[151,285],"provide":[152],"solutions":[154,168],"Teams":[158,185,199,227,295],"few":[161],"were":[163],"optimal":[167,305],"all":[170],"TSP":[172,202],"instances":[173],"tackled":[174],"whereas,":[175],"individual":[176],"could":[178],"not.":[179],"Moreover,":[180],"parallel":[181],"execution":[182,307],"on":[186,258],"computer":[188],"network":[189],"presented":[190],"linear":[191],"speed":[192],"up.":[193],"We":[194,264],"also":[195,265,290],"observed":[196],"scale":[204],"efficient;":[205],"is,":[207],"more":[209],"Team":[213],"uses,":[214],"performs.\r\nWe":[218],"tested":[219],"analyzed":[221],"several":[222],"design":[223],"parameters":[224],"such":[228],"as":[229],"selection":[230],"destruction":[232],"policies":[233,244],"(how":[234,245],"select":[236],"destroy":[238],"from":[240],"memories,)":[242,249],"initialization":[243],"initiate":[247],"memory":[250],"sizes,":[251],"influence":[254],"flows":[257],"performance":[260],"Teams.":[263,315],"present":[266,279],"some":[267],"specially":[268],"developed":[269],"be":[272],"exclusively":[273],"executed":[274],"Teams.\r\nFinally,":[277],"Markov-based":[281],"model":[282],"not":[284],"explains":[286],"behavior,":[288],"but":[289],"helps":[291],"designing":[293],"giving":[297],"insights":[298],"about":[299],"expected":[300],"value":[301],"final":[303],"solutions,":[304],"relative":[306],"frequencies":[308],"algorithms,":[310],"convergence":[312]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2154367227","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
