Search

Search Results

Results 81-90 of 94 (Search time: 0.511 seconds).
Item hits:
  • Sách/Book


  • Authors: Bahram Farhadinia (2021)

  • Presenting the review of many and important types of hesitant fuzzy extensions, and including references to a large number of related publications, this book will serve as a useful reference book for researchers in this field.

  • Sách/Book


  • Authors: Thomas H. Cormen (2001)

  • The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.

  • Sách/Book


  • Authors: Robert V. Hogg (2018)

  • Introduction to Mathematical Statistics by Hogg, McKean, and Craig enhances student comprehension and retention with numerous, illustrative examples and exercises. Classical statistical inference procedures in estimation and testing are explored extensively, and the text’s flexible organization makes it ideal for a range of mathematical statistics courses.

  • Sách/Book


  • Authors: Paul C. Cozby (2017)

  • Methods in Behavioral Research continues to guide students toward success by helping them study smarter and more efficiently. In tandem with SmartBook, McGraw-Hill’s adaptive and personalized reading experience, Cozby and Bates provide helpful pedagogy, rich examples, and a clear voice in their approach to methodological decision-making.

  • Sách/Book


  • Authors: Johannes Jahn (2011)

  • The theory is extended to set optimization with particular emphasis on contingent epiderivatives, subgradients and optimality conditions. Background material of convex analysis being necessary is concisely summarized at the beginning.

  • Sách/Book


  • Authors: Soubhik Chakraborty (2023)

  • As there can be more than one algorithm for the same problem, designing and analyzing an algorithm becomes important in order to make it as efficient and robust as possible. This book will serve as a guide to design and analysis of computer algorithms.

  • Sách/Book


  • Authors: Richard J. Larsen (2012)

  • Noted for its integration of real-world data and case studies, this text offers sound coverage of the theoretical aspects of mathematical statistics. The authors demonstrate how and when to use statistical methods, while reinforcing the calculus that students have mastered in previous courses. Throughout the Fifth Edition, the authors have added and updated examples and case studies, while also refining existing features that show a clear path from theory to practice.

  • Sách/Book


  • Authors: Michael Gr. Voskoglou (2020)

  • The present book contains 20 articles collected from amongst the 53 total submitted manuscripts for the Special Issue “Fuzzy Sets, Fuzzy Loigic and Their Applications” of the MDPI journal Mathematics. The articles, which appear in the book in the series in which they were accepted, published in Volumes 7 (2019) and 8 (2020) of the journal, cover a wide range of topics connected to the theory and applications of fuzzy systems and their extensions and generalizations.

  • Sách/Book


  • Authors: Lekh Raj Vermani (2019)

  • This book introduces a set of concepts in solving problems computationally such as Growth of Functions; Backtracking; Divide and Conquer; Greedy Algorithms; Dynamic Programming; Elementary Graph Algorithms; Minimal Spanning Tree; Single-Source Shortest Paths; All Pairs Shortest Paths; Flow Networks; Polynomial Multiplication, to ways of solving NP-Complete Problems, supported with comprehensive, and detailed problems and solutions, making it an ideal resource to those studying computer science, computer engineering and information technology.

  • Sách/Book


  • Authors: Bang Ye Wu (2004)

  • This book will be a welcome addition to your reference shelf whether your interests lie in graph and approximation algorithms for theoretical work or you use graph techniques to solve practical problems