株式会社極東書店トップ > 商品一覧 > Linguistic Geometry: From Search to Construction. Softcover reprint of the original 1st ed. 2000
商品詳細
Linguistic Geometry: From Search to Construction. Softcover reprint of the original 1st ed. 2000
・ISBN 978-1-4613-6999-8 paper EUR 299.99
¥80,186.- (税込) ※(※)価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Stilman, Boris, |
|---|---|
| シリーズ | (Operations Research/Computer Science Interfaces Series) |
| 出版社 | (Springer-Verlag New York Inc., US) |
| 出版年月 | 2012 |
| ページ数 | 395 pp. |
| 言語 | ENG |
| ニュース番号 | <A04-79497> |
解説
Linguistic Geometry: From Search to Construction is the first book of its kind. Linguistic Geometry (LG) is an approach to the construction of mathematical models for large-scale multi-agent systems. A number of such systems, including air/space combat, robotic manufacturing, software re-engineering and Internet cyberwar, can be modeled as abstract board games. These are games with moves that can be represented by the movement of abstract pieces over locations on an abstract board. The purpose of LG is to provide strategies to guide the games' participants to their goals. Traditionally, discovering such strategies required searches in giant game trees. These searches are often beyond the capacity of modern and even conceivable future computers.
LG dramatically reduces the size of the search trees, making the problems computationally tractable. LG provides a formalization and abstraction of search heuristics used by advanced experts including chess grandmasters. Essentially, these heuristics replace search with the construction of strategies. To formalize the heuristics, LG employs the theory of formal languages (i.e. formal linguistics), as well as certain geometric structures over an abstract board. The new formal strategies solve problems from different domains far beyond the areas envisioned by the experts. For a number of these domains, Linguistic Geometry yields optimal solutions.
LG dramatically reduces the size of the search trees, making the problems computationally tractable. LG provides a formalization and abstraction of search heuristics used by advanced experts including chess grandmasters. Essentially, these heuristics replace search with the construction of strategies. To formalize the heuristics, LG employs the theory of formal languages (i.e. formal linguistics), as well as certain geometric structures over an abstract board. The new formal strategies solve problems from different domains far beyond the areas envisioned by the experts. For a number of these domains, Linguistic Geometry yields optimal solutions.