Time-homogeneous parallel annealing algorithm:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Tokyo, Japan
1991
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
673 |
| Schlagwörter: | |
| Abstract: | Abstract: "We propose a new parallel simulated annealing algorithm. Each processor maintains one solution and performs the annealing process concurrently at a constant temperature that differs from processor to processor, and the solutions obtained by the processors are exchanged occasionally in some probabilistic way. An appropriate cooling schedule is automatically constructed from a given set of temperatures that are assigned to the processors. Thus we can avoid the task of carefully reducing the temperature over the course of time, which is essential for the performance of the conventional sequential algorithm. In this paper we propose a scheme for the probabilistic exchange of solutions and justify it from the viewpoint of probability theory We have applied our algorithm to a graph-partitioning problem. Results of experiments, and comparison with those by the sequential annealing algorithm and the Kernighan-Lin algorithm, are discussed. |
| Umfang: | 9 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010954464 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 960917s1991 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)26039984 | ||
| 035 | |a (DE-599)BVBBV010954464 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Kimura, Kouichi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Time-homogeneous parallel annealing algorithm |c by Kouichi Kimura & K. Taki |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 9 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 673 | |
| 520 | 3 | |a Abstract: "We propose a new parallel simulated annealing algorithm. Each processor maintains one solution and performs the annealing process concurrently at a constant temperature that differs from processor to processor, and the solutions obtained by the processors are exchanged occasionally in some probabilistic way. An appropriate cooling schedule is automatically constructed from a given set of temperatures that are assigned to the processors. Thus we can avoid the task of carefully reducing the temperature over the course of time, which is essential for the performance of the conventional sequential algorithm. In this paper we propose a scheme for the probabilistic exchange of solutions and justify it from the viewpoint of probability theory | |
| 520 | 3 | |a We have applied our algorithm to a graph-partitioning problem. Results of experiments, and comparison with those by the sequential annealing algorithm and the Kernighan-Lin algorithm, are discussed. | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Combinatorial optimization | |
| 700 | 1 | |a Taki, Kazuo |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 673 |w (DE-604)BV010923438 |9 673 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007326812 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6123-673 |
|---|---|
| DE-BY-TUM_katkey | 765876 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010279242 |
| _version_ | 1821938138811990016 |
| any_adam_object | |
| author | Kimura, Kouichi Taki, Kazuo |
| author_facet | Kimura, Kouichi Taki, Kazuo |
| author_role | aut aut |
| author_sort | Kimura, Kouichi |
| author_variant | k k kk k t kt |
| building | Verbundindex |
| bvnumber | BV010954464 |
| ctrlnum | (OCoLC)26039984 (DE-599)BVBBV010954464 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01979nam a2200325 cb4500</leader><controlfield tag="001">BV010954464</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">960917s1991 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26039984</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010954464</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kimura, Kouichi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Time-homogeneous parallel annealing algorithm</subfield><subfield code="c">by Kouichi Kimura & K. Taki</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">673</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We propose a new parallel simulated annealing algorithm. Each processor maintains one solution and performs the annealing process concurrently at a constant temperature that differs from processor to processor, and the solutions obtained by the processors are exchanged occasionally in some probabilistic way. An appropriate cooling schedule is automatically constructed from a given set of temperatures that are assigned to the processors. Thus we can avoid the task of carefully reducing the temperature over the course of time, which is essential for the performance of the conventional sequential algorithm. In this paper we propose a scheme for the probabilistic exchange of solutions and justify it from the viewpoint of probability theory</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We have applied our algorithm to a graph-partitioning problem. Results of experiments, and comparison with those by the sequential annealing algorithm and the Kernighan-Lin algorithm, are discussed.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Taki, Kazuo</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">673</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">673</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007326812</subfield></datafield></record></collection> |
| id | DE-604.BV010954464 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T10:03:46Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007326812 |
| oclc_num | 26039984 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 9 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| spellingShingle | Kimura, Kouichi Taki, Kazuo Time-homogeneous parallel annealing algorithm Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Algorithms Combinatorial optimization |
| title | Time-homogeneous parallel annealing algorithm |
| title_auth | Time-homogeneous parallel annealing algorithm |
| title_exact_search | Time-homogeneous parallel annealing algorithm |
| title_full | Time-homogeneous parallel annealing algorithm by Kouichi Kimura & K. Taki |
| title_fullStr | Time-homogeneous parallel annealing algorithm by Kouichi Kimura & K. Taki |
| title_full_unstemmed | Time-homogeneous parallel annealing algorithm by Kouichi Kimura & K. Taki |
| title_short | Time-homogeneous parallel annealing algorithm |
| title_sort | time homogeneous parallel annealing algorithm |
| topic | Algorithms Combinatorial optimization |
| topic_facet | Algorithms Combinatorial optimization |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT kimurakouichi timehomogeneousparallelannealingalgorithm AT takikazuo timehomogeneousparallelannealingalgorithm |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6123-673 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |