{"id":"https://openalex.org/W1864436770","doi":"https://doi.org/10.1109/ipps.1994.288294","title":"Parallel bidirectional heuristic search with dynamic process re-direction","display_name":"Parallel bidirectional heuristic search with dynamic process re-direction","publication_year":2002,"publication_date":"2002-12-17","ids":{"openalex":"https://openalex.org/W1864436770","doi":"https://doi.org/10.1109/ipps.1994.288294","mag":"1864436770"},"language":"en","primary_location":{"id":"doi:10.1109/ipps.1994.288294","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipps.1994.288294","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 8th International Parallel Processing Symposium","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/A5023117882","display_name":"Anestis A. Toptsis","orcid":null},"institutions":[{"id":"https://openalex.org/I192455969","display_name":"York University","ror":"https://ror.org/05fq50484","country_code":"CA","type":"education","lineage":["https://openalex.org/I192455969"]},{"id":"https://openalex.org/I185658715","display_name":"Universities UK","ror":"https://ror.org/00mmfs450","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I185658715"]}],"countries":["CA","GB"],"is_corresponding":true,"raw_author_name":"A.A. Toptsis","raw_affiliation_strings":["Department of Computer Science and Mathematics, Atkinson College, York University, Toronto, ONT, Canada","Dept. of Comput. Sci. & Math., York Univ., UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, Atkinson College, York University, Toronto, ONT, Canada","institution_ids":["https://openalex.org/I192455969"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Math., York Univ., UK","institution_ids":["https://openalex.org/I185658715"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023117882"],"corresponding_institution_ids":["https://openalex.org/I185658715","https://openalex.org/I192455969"],"apc_list":null,"apc_paid":null,"fwci":0.2249,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.53095875,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"242","last_page":"247"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9954000115394592,"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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9894999861717224,"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/uniprocessor-system","display_name":"Uniprocessor system","score":0.9297497272491455},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7458646893501282},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6814479827880859},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6645751595497131},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.6016993522644043},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.5662827491760254},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.5226783156394958},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.512638509273529},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5110622644424438},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.441040962934494},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32307595014572144},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2970072031021118},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23520344495773315},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.09794288873672485}],"concepts":[{"id":"https://openalex.org/C79189994","wikidata":"https://www.wikidata.org/wiki/Q3488021","display_name":"Uniprocessor system","level":3,"score":0.9297497272491455},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7458646893501282},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6814479827880859},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6645751595497131},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.6016993522644043},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.5662827491760254},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.5226783156394958},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.512638509273529},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5110622644424438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.441040962934494},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32307595014572144},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2970072031021118},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23520344495773315},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.09794288873672485},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipps.1994.288294","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipps.1994.288294","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 8th International Parallel Processing Symposium","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":4,"referenced_works":["https://openalex.org/W2023624803","https://openalex.org/W2083355299","https://openalex.org/W2097038466","https://openalex.org/W6674912493"],"related_works":["https://openalex.org/W2402589461","https://openalex.org/W2081821176","https://openalex.org/W2358427436","https://openalex.org/W2885402535","https://openalex.org/W58921990","https://openalex.org/W2747118187","https://openalex.org/W1622225657","https://openalex.org/W2064794194","https://openalex.org/W3192236608","https://openalex.org/W2397806795"],"abstract_inverted_index":{"Non-wave":[0],"shaping":[1],"parallel":[2,26,39],"bidirectional":[3,14,27,40,55],"heuristic":[4,41],"search":[5,15,42],"algorithms":[6,29],"have":[7],"been":[8],"reported":[9],"to":[10,81],"suffer":[11],"of":[12,58],"the":[13,22,52,66,85],"anomaly.":[16],"Although":[17],"wave-shaping":[18,28,36,56],"is":[19,49],"considered":[20],"as":[21],"most":[23],"natural":[24],"approach,":[25],"are":[30],"extremely":[31],"scarce.":[32],"We":[33],"introduce":[34],"a":[35],"algorithm":[37,57],"for":[38,74],"in":[43],"distributed":[44],"memory":[45],"environments.":[46],"The":[47],"method":[48,68],"inspired":[50],"by":[51],"celebrated":[53],"uniprocessor":[54],"DeChampeaux-Sint":[59,87],"(1977).":[60],"Our":[61],"performance":[62,73],"evaluation":[63],"shows":[64],"that":[65],"proposed":[67],"scales":[69],"well,":[70],"maintains":[71],"good":[72],"increasing":[75],"problem":[76],"sizes,":[77],"and":[78],"attains":[79],"close":[80],"linear":[82],"speedup":[83],"over":[84],"sequential":[86],"algorithm.<":[88],"<ETX":[89],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[90],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">&gt;</ETX>":[91]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}