Ditemukan 26 dokumen yang sesuai dengan query
Bovet, Daniel Piere
New York: Prentice-Hall, 1994
511.3 BOV i
Buku Teks Universitas Indonesia Library
"
The goal of this book is to uncover techniques that will aid in overcoming complexity and enable us to produce reliable, dependable computer systems that will operate as intended, and yet are produced on-time, in budget, and are evolvable, both over time and at run time. We hope that the contributions in this book will aid in understanding the nature of software complexity and provide guidance for the control or avoidance of complexity in the ...
"
London: Springer, 2012
e20407434
eBooks Universitas Indonesia Library
Winograd, Shmuel
"
Focuses on finding the minimum number of arithmetic operations needed to perform the computation and on finding a better algorithm when improvement is possible. The author concentrates on that class of problems concerned with computing a system of bilinear forms.
Results that lead to applications in the area of signal processing are emphasized, since (1) even a modest reduction in the execution time of signal processing problems could have practical significance; (2) results in this ...
"
Philadelphia : Society for Industrial and Applied Mathematics, 1980
e20442851
eBooks Universitas Indonesia Library
"
This monograph presents selected new developments in such areas of dependability research as system modelling, tools and methodologies for system analysis, data security, secure system design and specific dependability aspects in specialized technical applications. Many practical cases illustrate the universal rule that complexity and multiplicity of system processes, their concurrency and their reliance on embedded intelligence (human and artificial) significantly impedes construction of strict mathematical models and calls for application of intelligent and soft computing ...
"
Berlin: [Springer, ], 2012
e20398063
eBooks Universitas Indonesia Library
"
This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, in Saarbrücken, Germany, in September 2011. The 21 revised full papers presented were carefully reviewed and selected from 40 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results, ...
"
Berlin: Springer-Verlag , 2012
e20408803
eBooks Universitas Indonesia Library
"
This festschrift contains 20 papers that showcase the important scientific contributions of this remarkable man, describes the history of the field of parameterized complexity, and also reflects on other parts of Mike Fellows’s unique and broad range of interests, including his work on the popularization of discrete mathematics for young children.
...
"
Berlin: Springer, 2012
e 20406455
eBooks Universitas Indonesia Library
Zivny, Stanislav
"
In this book the author presents general techniques for analysing the structure of such functions and the computational complexity of the minimisation problem, and he gives a comprehensive list of tractable cases. Moreover, he demonstrates that the so-called algebraic approach to VCSPs can be used not only for the search for tractable VCSPs, but also for other questions such as finding the boundaries to the applicability of certain algorithmic techniques ...
"
Berlin: [, Springer-Verlag], 2012
e20408537
eBooks Universitas Indonesia Library
Gupta, Anupam, editor
"
This book constitutes the joint refereed proceedings of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2012, and the 16th International Workshop on Randomization and Computation, RANDOM 2012, held in Cambridge, Massachusetts, USA, in August 2011. The volume contains 28 contributed papers, selected by the APPROX Program Committee out of 70 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 67 submissions. APPROX focuses on algorithmic and ...
"
Berlin : [, Springer-Verlag], 2012
e20410055
eBooks Universitas Indonesia Library
"
This volume, reviewing and describing major threads in the mathematical modeling of science dynamics for a wider academic and professional audience. The model classes presented cover stochastic and statistical models, system-dynamics approaches, agent-based simulations, population-dynamics models, and complex-network models. The book comprises an introduction and a foundational chapter that defines and operationalizes terminology used in the study of science, as well as a review chapter that discusses the history of mathematical approaches to modeling science ...
"
Berlin: Springer-Verlag, 2012
e20410667
eBooks Universitas Indonesia Library
Creignou, Nadia
"
Many fundamental combinatorial problems, arising in such diverse fields as artificial intelligence, logic, graph theory, and linear algebra, can be formulated as Boolean constraint satisfaction problems (CSP). This book is devoted to the study of the complexity of such problems. The authors' goal is to develop a framework for classifying the complexity of Boolean CSP in a uniform way. In doing so, they bring out common themes underlying many concepts and results in both algorithms ...
"
Philadelphia : Society for Industrial and Applied Mathematics, 2001
e20442783
eBooks Universitas Indonesia Library
