|
Experimental Algorithmics 2002nd ed.(Lecture Notes in Computer Science Vol.2547) P XVIII, 286 p. 02
Fleischer, Rudolf,
Moret, Bernhard,
Meineche Schmidt, Erik
編
発行年月 |
2002年12月 |
|---|
|
出版国 |
ドイツ |
|---|
言語 |
英語 |
|---|
媒体 |
冊子 |
|---|
装丁 |
paper |
|---|
|
ページ数／巻数 |
XVIII, 286 p. |
|---|
|
|
ジャンル |
洋書 |
|---|
|
|
ISBN |
9783540003465 |
|---|
|
商品コード |
0200258666 |
|---|
|
|
|
本の性格 |
議事録 |
|---|
|
|
|
商品URL
| https://kw.maruzen.co.jp/ims/itemDetail.html?itmCd=0200258666 |
|---|
内容
Experimental algorithmics, as its name indicates, combines algorithmic work and experimentation: algorithms are not just designed, but also implemented and tested on a variety of instances. Perhaps the most important lesson in this process is that designing an algorithm is but the first step in the process of developing robust and efficient software for applications. Based on a seminar held at Dagstuhl Castle, Germany in September 2000, this state-of-the-art survey presents a coherent survey of the work done in the area so far. The 11 carefully reviewed chapters provide complete coverage of all current topics in experimental algorithmics.
