Logic Versus Approximation
Essays Dedicated to Michael M. Richter on the Occasion of His 65th Birthday
Nowadays knowledge-based systems research and development essentially employs two paradigms of reasoning. There are on the one hand the logic-based approaches where logic is to be understood in a rather broad sense; usually these approaches are used in symbolic domains where numerical calculations are not the core challenge. On the other hand we find approximation oriented reasoning; methods of these kinds are mainly applied in numerical domains where approximation is part of the scientific methodology itself. However, from an abstract level all these approaches do focus on similar topics and arise on various levels such as problem modeling, inference and problem solving techniques, algorithms and mathematical methods, mathematical relations between discrete and continuous properties, and are integrated in tools and applications. In accordance with the unifying vision and research interest of Michael M. Richter and in correspondence to his scientific work, this book presents 13 revised full papers advocating the integration of logic-based and approximation-oriented approaches in knowledge processing.
- ISBN 13 : 3540225625
- ISBN 10 : 9783540225621
- Judul : Logic Versus Approximation
- Sub Judul : Essays Dedicated to Michael M. Richter on the Occasion of His 65th Birthday
- Pengarang : Wolfgang Lenski (Ed ),
- Kategori : Computers
- Penerbit : Springer Science & Business Media
- Bahasa : en
- Tahun : 2004
- Halaman : 203
- Halaman : 203
- Google Book : http://books.google.co.id/books?id=882vfc8_1oIC&dq=intitle:logic+algorithm&hl=&source=gbs_api
-
Ketersediaan :
Problem-specific algorithms vs. heuristics, exact optimization vs. approximation
vs. heuristic solutions, guaranteed run time vs. expected run time vs.
experimental run time analysis. Here, a framework for a theory of randomized
search heuristics is presented. After a brief history of discrete optimization,
scenarios are discussed where randomized search heuristics are appropriate.
Different randomized se- arch heuristics are presented and it is argued why the
expected optimization time ...