Osamu Watanabe – författare
Visar alla böcker från författaren Osamu Watanabe. Handla med fri frakt och snabb leverans.
10 produkter
Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics
International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings
Av Takayasu Ito, Peter D. Mosses m. fl.
E-bok, 2000
1502 kr
Lägg i varukorg
In 1996 the International Federation for Information Processing (IFIP) establ- hed its rst Technical Committee on foundations of computer science, TC1. The aim of IFIP TC1 is to support the development of theoretical computer science as a fundamental science and to promote the exploration of …
Algorithmic Learning Theory
10th International Conference, ALT ''99 Tokyo, Japan, December 6-8, 1999 Proceedings
Av Takashi Yokomori, Osamu Watanabe
E-bok, 2007
755 kr
Lägg i varukorg
Algorithmic Learning Theory
10th International Conference, ALT '99 Tokyo, Japan, December 6-8, 1999 Proceedings
Av Osamu Watanabe, Takashi Yokomori
Häftad, 1999
566 kr
Lägg i varukorg
ThisvolumecontainsallthepaperspresentedattheInternationalConferenceon Algorithmic Learning Theory 1999 (ALT'99), held at Waseda University Int- nationalConferenceCenter,Tokyo,Japan,December 6?8,1999.Theconference was sponsored by the Japanese Society for Arti cial Intelligence (JSAI). In response …
Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics
International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings
Av Jan van Leeuwen, Osamu Watanabe m. fl.
Häftad, 2000
1126 kr
Lägg i varukorg
This book constitutes the refereed proceedings of the International Conference IFIP TCS 2000 held in Sendai, Japan in August 2000.The 32 revised full papers presented together with nine invited contributions were carefully reviewed and selected from a total of 70 submissions. The papers are …
Stochastic Algorithms: Foundations and Applications
5th International Symposium, SAGA 2009 Sapporo, Japan, October 26-28, 2009 Proceedings
Av Osamu Watanabe, Thomas Zeugmann
Häftad, 2009
550 kr
Lägg i varukorg
This book constitutes the refereed proceedings of the 5th International Symposium on Stochastic Algorithms, Foundations and Applications, SAGA 2009, held in Sapporo, Japan, in October 2009. The 15 revised full papers presented together with 2 invited papers were carefully reviewed and selected from …
Stochastic Algorithms: Foundations and Applications
5th International Symposium, SAGA 2009 Sapporo, Japan, October 26-28, 2009 Proceedings
Av Thomas Zeugmann, Osamu Watanabe
E-bok, 2009
712 kr
Lägg i varukorg
This book constitutes the refereed proceedings of the 5th International Symposium on Stochastic Algorithms, Foundations and Applications, SAGA 2009, held in Sapporo, Japan, in October 2009. The 15 revised full papers presented together with 2 invited papers were carefully reviewed and selected from …
Algorithms and Computation
22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings
Av Takao Asano, Shin-ichi Nakano m. fl.
Häftad, 2011
550 kr
Lägg i varukorg
This book constitutes the refereed proceedings of the 22nd International Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for …
Algorithms and Computation
22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings
Av Osamu Watanabe, Yoshio Okamoto m. fl.
E-bok, 2011
734 kr
Lägg i varukorg
This book constitutes the refereed proceedings of the 22nd International Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for …
Kolmogorov Complexity and Computational Complexity
E-bok, 2012
1427 kr
Lägg i varukorg
The mathematical theory of computation has given rise to two important ap proaches to the informal notion of "complexity": Kolmogorov complexity, usu ally a complexity measure for a single object such as a string, a sequence etc., measures the amount of information necessary to describe the …
Kolmogorov Complexity and Computational Complexity
Häftad, 2011
1093 kr
Lägg i varukorg
The mathematical theory of computation has given rise to two important ap proaches to the informal notion of "complexity": Kolmogorov complexity, usu ally a complexity measure for a single object such as a string, a sequence etc., measures the amount of information necessary to describe the …
