{"id":"https://openalex.org/W1979922451","doi":"https://doi.org/10.1080/10637199808947380","title":"CONVERGENCE ANALYSIS OF STOCHASTIC DIFFUSION SEARCH","display_name":"CONVERGENCE ANALYSIS OF STOCHASTIC DIFFUSION SEARCH","publication_year":1999,"publication_date":"1999-07-01","ids":{"openalex":"https://openalex.org/W1979922451","doi":"https://doi.org/10.1080/10637199808947380","mag":"1979922451"},"language":"en","primary_location":{"id":"doi:10.1080/10637199808947380","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199808947380","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-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/A5058704923","display_name":"Slawomir J. Nasuto","orcid":"https://orcid.org/0000-0001-9414-9049"},"institutions":[{"id":"https://openalex.org/I71052956","display_name":"University of Reading","ror":"https://ror.org/05v62cm79","country_code":"GB","type":"education","lineage":["https://openalex.org/I71052956"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"S. NASUTO","raw_affiliation_strings":["Department of Cybernetics, University of Reading, Reading, RG62AE, UK","Department of Cybernetics , University of Reading , Reading, RG62AE, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Cybernetics, University of Reading, Reading, RG62AE, UK","institution_ids":["https://openalex.org/I71052956"]},{"raw_affiliation_string":"Department of Cybernetics , University of Reading , Reading, RG62AE, UK","institution_ids":["https://openalex.org/I71052956"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043526765","display_name":"Martin J. Bishop","orcid":"https://orcid.org/0000-0003-3357-1531"},"institutions":[{"id":"https://openalex.org/I71052956","display_name":"University of Reading","ror":"https://ror.org/05v62cm79","country_code":"GB","type":"education","lineage":["https://openalex.org/I71052956"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"M. BISHOP","raw_affiliation_strings":["Department of Cybernetics, University of Reading, Reading, RG62AE, UK","Department of Cybernetics , University of Reading , Reading, RG62AE, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Cybernetics, University of Reading, Reading, RG62AE, UK","institution_ids":["https://openalex.org/I71052956"]},{"raw_affiliation_string":"Department of Cybernetics , University of Reading , Reading, RG62AE, UK","institution_ids":["https://openalex.org/I71052956"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I71052956"],"apc_list":null,"apc_paid":null,"fwci":3.8243,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.93249876,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":"2","first_page":"89","last_page":"107"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9984999895095825,"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.9984999895095825,"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/T11106","display_name":"Data Management and Algorithms","score":0.9847000241279602,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9714999794960022,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6402601003646851},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6273336410522461},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.603047788143158},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5455335378646851},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4880143702030182},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.4690559208393097},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.45403265953063965},{"id":"https://openalex.org/keywords/pattern-search","display_name":"Pattern search","score":0.4345690906047821},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4287009537220001},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4201706349849701},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35173499584198},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.336577832698822}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6402601003646851},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6273336410522461},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.603047788143158},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5455335378646851},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4880143702030182},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.4690559208393097},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.45403265953063965},{"id":"https://openalex.org/C82691427","wikidata":"https://www.wikidata.org/wiki/Q4291856","display_name":"Pattern search","level":2,"score":0.4345690906047821},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4287009537220001},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4201706349849701},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35173499584198},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.336577832698822},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10637199808947380","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199808947380","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"},{"id":"pmh:oai:centaur.reading.ac.uk:18633","is_oa":false,"landing_page_url":"https://centaur.reading.ac.uk/18633/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402273","display_name":"CentAUR (University of Reading)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I71052956","host_organization_name":"University of Reading","host_organization_lineage":["https://openalex.org/I71052956"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W199174557","https://openalex.org/W204046101","https://openalex.org/W1497256448","https://openalex.org/W1541580969","https://openalex.org/W1946111099","https://openalex.org/W1987933853","https://openalex.org/W2024060531","https://openalex.org/W2075379212","https://openalex.org/W2151676833","https://openalex.org/W2161259239","https://openalex.org/W2257788605","https://openalex.org/W3003764479"],"related_works":["https://openalex.org/W2824406300","https://openalex.org/W2013377696","https://openalex.org/W2356773499","https://openalex.org/W2059389108","https://openalex.org/W2097163054","https://openalex.org/W2099124466","https://openalex.org/W2097787789","https://openalex.org/W2377797968","https://openalex.org/W2563434343","https://openalex.org/W2095370091"],"abstract_inverted_index":{"In":[0,27],"this":[1,104],"paper":[2,105],"we":[3],"present":[4],"a":[5,19,23,69,85,126],"connectionist":[6],"searching":[7,67],"technique":[8],"-":[9,43],"the":[10,31,34,48,58,76,91,95,98,107],"Stochastic":[11],"Diffusion":[12],"Search":[13],"(SDS),":[14],"capable":[15],"of":[16,33,57,65,78,94,110,122],"rapidly":[17],"locating":[18],"specified":[20],"pattern":[21,36],"in":[22,47,68,97,103,133],"noisy":[24],"search":[25,49,60,99],"space.":[26,50,100],"operation":[28],"SDS":[29,82,111,123],"finds":[30],"position":[32],"pre-specified":[35],"or":[37],"if":[38],"it":[39,89,125],"does":[40],"not":[41],"exist":[42],"its":[44],"best":[45,92],"instantiation":[46,93],"This":[51],"is":[52],"achieved":[53],"via":[54],"parallel":[55],"exploration":[56],"whole":[59],"space":[61],"by":[62],"an":[63],"ensemble":[64],"agents":[66],"competitive":[70],"cooperative":[71],"manner.":[72],"We":[73],"prove":[74],"mathematically":[75],"convergence":[77,120],"stochastic":[79],"diffusion":[80],"search.":[81],"converges":[83],"to":[84],"statistical":[86],"equilibrium":[87],"when":[88],"locates":[90],"object":[96],"Experiments":[101],"presented":[102],"indicate":[106],"high":[108],"robustness":[109],"and":[112,130],"show":[113],"good":[114],"scalability":[115],"with":[116],"problem":[117],"size.":[118],"The":[119],"characteristic":[121],"makes":[124],"fully":[127],"adaptive":[128],"algorithm":[129],"suggests":[131],"applications":[132],"dynamically":[134],"changing":[135],"environments.":[136]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":6}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}