FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2774887870> ?p ?o ?g. }

• W2774887870 endingPage "237" @default.
• W2774887870 startingPage "199" @default.
• W2774887870 abstract "Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have been extensively used for mimicking several natural processes and systems to find fine solutions in many complex hard to solve computer science and engineering problems. Among them, the shortest path problem is one of the most pronounced and highly studied problems that scientists have been trying to tackle by using a plethora of methodologies and even unconventional approaches. The proposed solutions are mainly justified by their ability to provide a correct solution in a better time complexity than the renowned Dijkstra’s algorithm. Although there is a wide variety regarding the algorithmic complexity of the algorithms suggested, spanning from simplistic graph traversal algorithms to complex nature inspired and bio-mimicking algorithms, in this chapter we focus on the successful application of CAs to shortest path problem as found in various diverse disciplines like computer science, swarm robotics, computer networks, decision science and biomimicking of biological organisms’ behaviour. In particular, an introduction on the first CA-based algorithm tackling the shortest path problem is provided in detail. After the short presentation of shortest path algorithms arriving from the relaxization of the CAs principles, the application of the CA-based shortest path definition on the coordinated motion of swarm robotics is also introduced. Moreover, the CA based application of shortest path finding in computer networks is presented in brief. Finally, a CA that models exactly the behavior of a biological organism, namely the Physarum’s behavior, finding the minimum-length path between two points in a labyrinth is given. The CA-based model results are found in very good agreement with the computation results produced by the in-vivo experiments especially when combined with truly parallel implementations of this CA in a Field Programmable Gate Array (FPGA) and on a Graphical Processing Unit (GPU). The presented implementations succeed to take advantage of the CA’s inherit parallelism and significantly improve the performance of the CA algorithm when compared with software in terms of computational speed and power consumption." @default.
• W2774887870 created "2017-12-22" @default.
• W2774887870 creator A5008924272 @default.
• W2774887870 creator A5011946403 @default.
• W2774887870 creator A5012322074 @default.
• W2774887870 creator A5036652783 @default.
• W2774887870 creator A5040987801 @default.
• W2774887870 creator A5044688879 @default.
• W2774887870 date "2018-01-01" @default.
• W2774887870 modified "2023-10-04" @default.
• W2774887870 title "Cellular Automata Applications in Shortest Path Problem" @default.
• W2774887870 cites W1495718607 @default.
• W2774887870 cites W1530434734 @default.
• W2774887870 cites W1550227050 @default.
• W2774887870 cites W1661179413 @default.
• W2774887870 cites W193029540 @default.
• W2774887870 cites W1969839206 @default.
• W2774887870 cites W1970276631 @default.
• W2774887870 cites W1983704012 @default.
• W2774887870 cites W1986622474 @default.
• W2774887870 cites W1992138899 @default.
• W2774887870 cites W2003708116 @default.
• W2774887870 cites W2007572995 @default.
• W2774887870 cites W2011713560 @default.
• W2774887870 cites W2014363560 @default.
• W2774887870 cites W2014716520 @default.
• W2774887870 cites W2015203053 @default.
• W2774887870 cites W2023629075 @default.
• W2774887870 cites W2028355247 @default.
• W2774887870 cites W2030557272 @default.
• W2774887870 cites W2036234346 @default.
• W2774887870 cites W2046392651 @default.
• W2774887870 cites W2054326643 @default.
• W2774887870 cites W2067926714 @default.
• W2774887870 cites W2073368046 @default.
• W2774887870 cites W2082756313 @default.
• W2774887870 cites W2082845025 @default.
• W2774887870 cites W2090052326 @default.
• W2774887870 cites W2092330486 @default.
• W2774887870 cites W2093659491 @default.
• W2774887870 cites W2098692763 @default.
• W2774887870 cites W2101720181 @default.
• W2774887870 cites W2104734478 @default.
• W2774887870 cites W2109490756 @default.
• W2774887870 cites W2119380466 @default.
• W2774887870 cites W2123291961 @default.
• W2774887870 cites W2138132024 @default.
• W2774887870 cites W2145053972 @default.
• W2774887870 cites W2152679156 @default.
• W2774887870 cites W2153580689 @default.
• W2774887870 cites W2154376416 @default.
• W2774887870 cites W2163564638 @default.
• W2774887870 cites W2169528473 @default.
• W2774887870 cites W2246357212 @default.
• W2774887870 cites W2321638065 @default.
• W2774887870 cites W2331250829 @default.
• W2774887870 cites W2340238674 @default.
• W2774887870 cites W2419558715 @default.
• W2774887870 cites W2462605662 @default.
• W2774887870 cites W2468442346 @default.
• W2774887870 cites W2512215428 @default.
• W2774887870 cites W2520792837 @default.
• W2774887870 cites W2527988513 @default.
• W2774887870 cites W2592422646 @default.
• W2774887870 cites W2729421105 @default.
• W2774887870 cites W2963741408 @default.
• W2774887870 cites W913774037 @default.
• W2774887870 doi "https://doi.org/10.1007/978-3-319-77510-4_8" @default.
• W2774887870 hasPublicationYear "2018" @default.
• W2774887870 type Work @default.
• W2774887870 sameAs 2774887870 @default.
• W2774887870 citedByCount "3" @default.
• W2774887870 countsByYear W27748878702020 @default.
• W2774887870 countsByYear W27748878702022 @default.
• W2774887870 crossrefType "book-chapter" @default.
• W2774887870 hasAuthorship W2774887870A5008924272 @default.
• W2774887870 hasAuthorship W2774887870A5011946403 @default.
• W2774887870 hasAuthorship W2774887870A5012322074 @default.
• W2774887870 hasAuthorship W2774887870A5036652783 @default.
• W2774887870 hasAuthorship W2774887870A5040987801 @default.
• W2774887870 hasAuthorship W2774887870A5044688879 @default.
• W2774887870 hasBestOaLocation W27748878702 @default.
• W2774887870 hasConcept C112505250 @default.
• W2774887870 hasConcept C11413529 @default.
• W2774887870 hasConcept C132525143 @default.
• W2774887870 hasConcept C22590252 @default.
• W2774887870 hasConcept C2777735758 @default.
• W2774887870 hasConcept C31258907 @default.
• W2774887870 hasConcept C35527583 @default.
• W2774887870 hasConcept C41008148 @default.
• W2774887870 hasConcept C80444323 @default.
• W2774887870 hasConceptScore W2774887870C112505250 @default.
• W2774887870 hasConceptScore W2774887870C11413529 @default.
• W2774887870 hasConceptScore W2774887870C132525143 @default.
• W2774887870 hasConceptScore W2774887870C22590252 @default.
• W2774887870 hasConceptScore W2774887870C2777735758 @default.
• W2774887870 hasConceptScore W2774887870C31258907 @default.
• W2774887870 hasConceptScore W2774887870C35527583 @default.

• next