{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1370016973449261184.json","@type":"Product","dc:title":[{"@value":"Optimization by simulated annealing"}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1380016973449261313","@type":"Researcher","foaf:name":[{"@value":"Gelatt CD"}]}],"publication":{"prism:publicationName":[{"@value":"Science"}],"prism:publicationDate":"1983","prism:volume":"200","prism:startingPage":"671"},"relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1390001204604306176","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"A Multi-Teacher Learning Automata Computing Model for Graph Partitioning Problems"},{"@language":"ja","@value":"グラフ分割問題における多教師付き学習オートマトン計算法"},{"@language":"ja-Kana","@value":"グラフ ブンカツ モンダイ ニ オケル タキョウシ ツキ ガクシュウ オートマトン ケイサンホウ"},{"@value":"A multi‐teacher learning automata computing model for graph partitioning problems"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1002/eej.10310_references_P4N1rNz3FOcf8s5CHwYjrk6L8ka"}]}