Hasil Pencarian  ::  Simpan CSV :: Kembali

"Skripsi ini merupakan usaha untuk merumuskan filsafat secara komprehensif. Filsafat adalah produk rasionalitas probabilistik tanpa spesifikasi metodologi, evidensi, dan subject-matter. Hal tersebut menjelaskan kondisi filsafat yang sporadis, sekaligus merupakan pernyataan yang bisa mendasari segala karakteristik filsafat secara historis.This study is an examination in effort to formulate comprehensive philosophy. Philosophy is probabilistic rationality product without any specification in methodology, evidence, and subject-matter. This explains why philosophy is sporadic, all at once is a foundational statement of all philosophy charateristics, historically."

"This update of the 1987 title of the same name is an examination of what is currently known about the probabilistic method, written by one of its principal developers. Based on the notes from Spencer's 1986 series of ten lectures, this new edition contains an additional lecture: The Janson Inequalities. These inequalities allow accurate approximation of extremely small probabilities. A new algorithmic approach to the Lovasz Local Lemma, attributed to Jozsef Beck, has been added to Lecture 8, as well. Throughout the monograph, Spencer retains the informal style of his original lecture notes and emphasizes the methodology, shunning the more technical "best possible" results in favor of clearer exposition. The book is not encyclopedic--it contains only those examples that clearly display the methodology. The probabilistic method is a powerful tool in graph theory, combinatorics, and theoretical computer science. It allows one to prove the existence of objects with certain properties (e.g., colorings) by showing that an appropriately defined random object has positive probability of having those properties."

"The field of probabilistic expert systems has continued to flourish since the author delivered his lectures on the topic in June 1992, but the understanding of join-tree architectures has remained missing from the literature. This monograph fills this void by providing an analysis of join-tree methods for the computation of prior and posterior probabilities in belief nets. These methods, pioneered in the mid to late 1980s, continue to be central to the theory and practice of probabilistic expert systems. In addition to purely probabilistic expert systems, join-tree methods are also used in expert systems based on Dempster-Shafer belief functions or on possibility measures. Variations are also used for computation in relational databases, in linear optimization, and in constraint satisfaction. This book describes probabilistic expert systems in a more rigorous and focused way than existing literature, and provides an annotated bibliography that includes pointers to conferences and software. Also included are exercises that will help the reader begin to explore the problem of generalizing from probability to broader domains of recursive computation."