FRINK Linked Data Fragments server

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

• W2085454989 endingPage "455" @default.
• W2085454989 startingPage "447" @default.
• W2085454989 abstract "International Journal of Computational Intelligence and ApplicationsVol. 02, No. 04, pp. 447-455 (2002) Special Issue on Design of Intelligent AgentsNo AccessLOCAL SEARCH BY CONCENTRATION-CONTROLLED DNA COMPUTINGMASAHITO YAMAMOTO, YUMI KAWAZOE, AZUMA OHUCHI, ATSUSHI KAMEDA, NOBUO MATSUURA, and TOSHIKAZU SHIBAMASAHITO YAMAMOTOPRESTO, JST, Hokkaido University, North 13, West 8, Kita-ku, Sapporo 060-8628, JapanGraduate School of Engineering, Hokkaido University, North 13, West 8, Kita-ku, Sapporo 060-862, Japan Search for more papers by this author , YUMI KAWAZOEGraduate School of Dental Medicine, Hokkaido University, North 13, West 8, Kita-ku, Sapporo 060-8628, Japan Search for more papers by this author , AZUMA OHUCHIGraduate School of Engineering, Hokkaido University, North 13, West 8, Kita-ku, Sapporo 060-862, Japan Search for more papers by this author , ATSUSHI KAMEDAJapan Science and Technology Cooperation (JST), Honmachi 4-1-8, Kawaguchi 332-0012, Japan Search for more papers by this author , NOBUO MATSUURATOYOTA Motor Corporation, 7 Teiho, Teiho-cho, Toyota 471-8574, Japan Search for more papers by this author , and TOSHIKAZU SHIBAFrontier Research Division, FUJIREBIO Inc., 51 Komiya, Hachioji, Tokyo 192-0031, Japan Search for more papers by this author https://doi.org/10.1142/S1469026802000750Cited by:8 PreviousNext AboutSectionsPDF/EPUB ToolsAdd to favoritesDownload CitationsTrack CitationsRecommend to Library ShareShare onFacebookTwitterLinked InRedditEmail AbstractConcentration-controlled DNA computing is presented for accomplishing a local search for the solution of a shortest path problem. In this method, the concentrations of DNA representing edges are determined according to the costs on edges, and then the hybridization process is performed. Since the concentrations of hopeless candidate solutions tend to be small after the hybridization process, a local search by concentration-controlled DNA computing is a promising approach. In order to discuss about the relationship between given costs on edges in the graph and concentrations of generated DNA paths, a simulation model of the hybridization process is used and the results of a laboratory experiment are shown.Keywords:DNA computingshortest path problemlocal search Remember to check out the Most Cited Articles! Check out these titles in artificial intelligence! FiguresReferencesRelatedDetailsCited By 8DNA algorithm employing temperature gradient for Freeze-Tag Problem in swarm roboticsB.S.E. Zoraida, Michael Arock, B.S.M. Ronald and R. Ponalagusamy12 July 2010 | Transactions of the Institute of Measurement and Control, Vol. 34, No. 2-3DNA Algorithm Employing Temperature Gradient for Chinese Postman ProblemB. S. E. Zoraida1 Jul 2011Direct-Proportional Length-Based DNA Computing Implementation for Elevator Scheduling ProblemMohd Muhammad, Zuwairie Ibrahim, Osamu Ono and Marzuki Khalid1 Nov 2005DNA Computing for Complex Scheduling ProblemMohd Saufee Muhammad, Zuwairie Ibrahim, Satomi Ueda, Osamu Ono and Marzuki Khalid1 Jan 2005Improving Initial Pool Generation of Direct-Proportional Length-Based DNA Computing by Parallel Overlap AssemblyZuwairie Ibrahim, Yusei Tsuboi, Osamu Ono and Marzuki KhalidSolving Elevator Scheduling Problem Using DNA Computing ApproachMohd Saufee Muhammad, Satomi Ueda, Osamu Ono, Junzo Watada and Marzuki KhalidExperimental and Simulation Design of an Engineering Scheduling Problem Based on Molecular Computing ApproachMohd Saufee Muhammad and Osamu OnoDNA Implementation of k-shortest Paths ComputationZ. Ibrahim, Y. Tsuboi, M.S. Muhammad, O. Ono and M. Khalid Recommended Vol. 02, No. 04 Metrics History Received 6 March 2002 Revised 31 July 2002 KeywordsDNA computingshortest path problemlocal searchPDF download" @default.
• W2085454989 created "2016-06-24" @default.
• W2085454989 creator A5005645734 @default.
• W2085454989 creator A5019528844 @default.
• W2085454989 creator A5025547247 @default.
• W2085454989 creator A5043496932 @default.
• W2085454989 creator A5068286396 @default.
• W2085454989 creator A5085165516 @default.
• W2085454989 date "2002-12-01" @default.
• W2085454989 modified "2023-09-23" @default.
• W2085454989 title "LOCAL SEARCH BY CONCENTRATION-CONTROLLED DNA COMPUTING" @default.
• W2085454989 cites W2117052822 @default.
• W2085454989 cites W2578481235 @default.
• W2085454989 doi "https://doi.org/10.1142/s1469026802000750" @default.
• W2085454989 hasPublicationYear "2002" @default.
• W2085454989 type Work @default.
• W2085454989 sameAs 2085454989 @default.
• W2085454989 citedByCount "18" @default.
• W2085454989 crossrefType "journal-article" @default.
• W2085454989 hasAuthorship W2085454989A5005645734 @default.
• W2085454989 hasAuthorship W2085454989A5019528844 @default.
• W2085454989 hasAuthorship W2085454989A5025547247 @default.
• W2085454989 hasAuthorship W2085454989A5043496932 @default.
• W2085454989 hasAuthorship W2085454989A5068286396 @default.
• W2085454989 hasAuthorship W2085454989A5085165516 @default.
• W2085454989 hasConcept C111919701 @default.
• W2085454989 hasConcept C11413529 @default.
• W2085454989 hasConcept C132525143 @default.
• W2085454989 hasConcept C135320971 @default.
• W2085454989 hasConcept C185592680 @default.
• W2085454989 hasConcept C186060115 @default.
• W2085454989 hasConcept C22590252 @default.
• W2085454989 hasConcept C2777735758 @default.
• W2085454989 hasConcept C31258907 @default.
• W2085454989 hasConcept C41008148 @default.
• W2085454989 hasConcept C45374587 @default.
• W2085454989 hasConcept C552990157 @default.
• W2085454989 hasConcept C55493867 @default.
• W2085454989 hasConcept C80444323 @default.
• W2085454989 hasConcept C82047324 @default.
• W2085454989 hasConcept C86803240 @default.
• W2085454989 hasConcept C98045186 @default.
• W2085454989 hasConceptScore W2085454989C111919701 @default.
• W2085454989 hasConceptScore W2085454989C11413529 @default.
• W2085454989 hasConceptScore W2085454989C132525143 @default.
• W2085454989 hasConceptScore W2085454989C135320971 @default.
• W2085454989 hasConceptScore W2085454989C185592680 @default.
• W2085454989 hasConceptScore W2085454989C186060115 @default.
• W2085454989 hasConceptScore W2085454989C22590252 @default.
• W2085454989 hasConceptScore W2085454989C2777735758 @default.
• W2085454989 hasConceptScore W2085454989C31258907 @default.
• W2085454989 hasConceptScore W2085454989C41008148 @default.
• W2085454989 hasConceptScore W2085454989C45374587 @default.
• W2085454989 hasConceptScore W2085454989C552990157 @default.
• W2085454989 hasConceptScore W2085454989C55493867 @default.
• W2085454989 hasConceptScore W2085454989C80444323 @default.
• W2085454989 hasConceptScore W2085454989C82047324 @default.
• W2085454989 hasConceptScore W2085454989C86803240 @default.
• W2085454989 hasConceptScore W2085454989C98045186 @default.
• W2085454989 hasIssue "04" @default.
• W2085454989 hasLocation W20854549891 @default.
• W2085454989 hasOpenAccess W2085454989 @default.
• W2085454989 hasPrimaryLocation W20854549891 @default.
• W2085454989 hasRelatedWork W1596801655 @default.
• W2085454989 hasRelatedWork W2358668433 @default.
• W2085454989 hasRelatedWork W2376932109 @default.
• W2085454989 hasRelatedWork W2387147530 @default.
• W2085454989 hasRelatedWork W2390279801 @default.
• W2085454989 hasRelatedWork W2748952813 @default.
• W2085454989 hasRelatedWork W2898879311 @default.
• W2085454989 hasRelatedWork W2899084033 @default.
• W2085454989 hasRelatedWork W2954121957 @default.
• W2085454989 hasRelatedWork W2997738523 @default.
• W2085454989 hasVolume "02" @default.
• W2085454989 isParatext "false" @default.
• W2085454989 isRetracted "false" @default.
• W2085454989 magId "2085454989" @default.
• W2085454989 workType "article" @default.