Hasil Pencarian  ::  Kembali

Hasil Pencarian

Ditemukan 73 dokumen yang sesuai dengan query
cover
Joachim Gudmundsson, editor
This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012. The 50 revised full papers presented were carefully reviewed and selected from 121 submissions. Topics covered are algorithms and data structures, algorithmic game theory and online...
Berlin: [, Springer-Verlag], 2012
e20410103
eBooks  Universitas Indonesia Library
cover
Johan Jeuring, editor
This book constitutes the joint refereed proceedings of the 11th International Conference on Artificial Intelligence and Symbolic Computation, AISC 2012, 19th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, Calculemus 2012, 5th International Workshop on Digital Mathematics Libraries, DML 2012, 11th International Conference on Mathematical Knowledge Management, MKM...
Berlin : [Springer-Verlag, ], 2012
e20410417
eBooks  Universitas Indonesia Library
cover
The papers in this volume were presented at the Ninteenth Annual ACM-SIAM Symposium on Discrete Algorithms, held January 20-22, 2008, in San Francisco, California. The Symposium was jointly sponsored by the SIAM Activity Group on Discrete Mathematics and by SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory...
New York: Association for Computing Machinery, 2008
e20450983
eBooks  Universitas Indonesia Library
cover
This our material is divided into three main chapters followed by a postscript. These cover elementary number theory, calculus of one and several variables, introductory linear algebra, and visualization and interactive geometric computation...
New York: Springer Science;, 2012
e20419008
eBooks  Universitas Indonesia Library
cover
Jager, Tibor, author
Generic group algorithms solve computational problems defined over algebraic groups without exploiting properties of a particular representation of group elements. This is modeled by treating the group as a black-box. The fact that a computational problem cannot be solved by a reasonably restricted class of algorithms may be seen as...
Wiesbaden: [Springer Spektrum , ], 2012
e20419322
eBooks  Universitas Indonesia Library
cover
Jukna, Stasys, author
Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that have been discovered...
London : [Springer , ], 2012
e20419348
eBooks  Universitas Indonesia Library
cover
Telah dilakukan penelitian berupa pengenalan kualitas fisika air mineral dengan tnenggunakan jaringan saraf tiruan. Ktralitas fisika air yang dikenalkan adalah intensitas cahaya dan deviasi temperatur air terhadap lingkungan. Tujuan penelitian ini adalah membangun sistem pengukur intensitas cahaya dan deviasi temperatur air terkomputerisasi yang diolah dengan algoritma jaringan saraf tiruan. Sensor...
JURFIN 8:25 (2005)
Artikel Jurnal  Universitas Indonesia Library
cover
Anthony, Martin, author
This concise, readable book provides a sampling of the very large, active, and expanding field of artificial neural network theory. It considers select areas of discrete mathematics linking combinatorics and the theory of the simplest types of artificial neural networks. Neural networks have emerged as a key technology in many...
Philadelphia : Society for Industrial and Applied Mathematics, 2001
e20442716
eBooks  Universitas Indonesia Library
cover
Komzsik, Louis, author
The Lanczos Method: Evolution and Application is divided into two distinct parts. The first part reviews the evolution of one of the most widely used numerical techniques in the industry. The development of the method, as it became more robust, is demonstrated through easy-to-understand algorithms. The second part contains industrial...
Philadelphia: Society for Industrial and Applied Mathematics, 2003
e 20443320
eBooks  Universitas Indonesia Library
cover
We were very pleased to choose papers for presentation at the ACM-SIAM Symposium on Discrete Algorithms (SODA), which will take place in Manhattan in January 2009. A total of 550 short abstracts were submitted, later materializing into 458 submissions, of which 135 were selected. The program committee meeting was entirely...
New York: Association for Computing Machinery, 2009
e20451039
eBooks  Universitas Indonesia Library
<<   1 2 3 4 5 6 7 8   >>