Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Computing Methodologies (I) > Symbolic and Algebraic Manipulation (I.1) > Algorithms (I.1.2) > Analysis Of Algorithms (I.1.2...)  
 
Options:
 
  1-10 of 85 Reviews about "Analysis Of Algorithms (I.1.2...)": Date Reviewed
  Automated machine learning: methods, systems, challenges
Hutter F., Kotthoff L., Vanschoren J.,  Springer International Publishing, New York, NY, 2019. 219 pp. Type: Book (978-3-030053-17-8)

A dataset, generically speaking, is a collection of numbers. It constitutes an information element when structure and context are assigned. The objective of machine learning (ML) is to interpret an information element as a human would. This requir...

Jun 14 2021
  Bayesian analysis in natural language processing (2nd ed.)
Cohen S., Hirst G.,  Morgan&Claypool Publishers, San Rafael, CA, 2019. 344 pp. Type: Book (978-1-681735-26-9)

Morgan & Claypool’s “Synthesis Lectures on Human Language Technologies” series provides grounded theory and practical approaches in an applied research sense. Bayesian analysis in natural language processing is in this...

May 28 2021
   Don Knuth: The analysis of algorithms
Don Knuth. YouTube, 01:02:33, published on Jan 30, 2017, stanfordonline, https://www.youtube.com/watch?v=jmcSzzN1gkc. Type: Video

Don Knuth needs no introduction. Computer science labs around the world are decorated with posters of Professor Knuth, and many academics have on their bookshelves at least the first volume of The art of computer programming [1]. As a pione...

May 8 2018
  On minimum sum of radii and diameters clustering
Behsaz B., Salavatipour M.  Algorithmica 73(1): 143-165, 2015. Type: Article

The minimum sum of radii (MSR) problem is that of finding the least possible sum of radii of (at most) k clusters covering a set V of n points, where the points form a graph whose edges have...

Oct 8 2015
  The (weighted) metric dimension of graphs: hard and easy cases
Epstein L., Levin A., Woeginger G.  Algorithmica 72(4): 1130-1171, 2015. Type: Article

Metric dimension (MD) optimization algorithms require computation in such areas as network verification, mastermind games, metric and digital geometry, image digitization, robot navigation, drug discovery, and combinatorics problems. The authors t...

Aug 31 2015
  Robustness of full implication algorithms based on interval-valued fuzzy inference
Luo M., Zhang K.  International Journal of Approximate Reasoning 62(C): 61-72, 2015. Type: Article

In fuzzy set theory, propositions and inference rules denote fuzzy sets and fuzzy relations, respectively, which use the new input and the defined fuzzy relation to estimate fuzzy reasoning. This fuzzy reasoning is comprised of fuzzy modus ponens ...

Aug 21 2015
  Model checking with strong fairness
Kesten Y., Pnueli A., Raviv L., Shahar E.  Formal Methods in System Design 28(1): 57-84, 2006. Type: Article

Classical model checking methods for temporal logic formulas suffer from the problem of unsatisfactory treatment of fairness—only a weak form of fairness, “justice,” is directly addressed. “Compassion,&#...

Nov 23 2006
  Construction of generalized Gauss-Jacobi quadratures by means of computer algebra methods
Bogolubsky A., Skorokhodov S.  Programming and Computing Software 31(2): 103-109, 2005. Type: Article

Gauss-type quadrature formulas are extremely useful, efficient, and accurate methods for the numerical computation of many types of weighted integrals. However, the computation of such formulas (namely, of their weights and nodes) in closed form i...

Mar 28 2006
  The greedy algorithm for shortest superstrings
Kaplan H., Shafrir N.  Information Processing Letters 93(1): 13-17, 2005. Type: Article

The shortest superstring problem is as follows: given a finite set of strings, find the shortest possible string s, such that every string in the set is a substring of s. Although this question is nondetermini...

Nov 3 2005
  KBFS: K-best-first search
Felner A., Kraus S., Korf R.  Annals of Mathematics and Artificial Intelligence 39(1-2): 19-39, 2003. Type: Article

It is a very well-known result that in the presence of a perfect heuristic function (that is, h (n,t) = g* (n,t)), an admissible single-agent search algorithm e...

Oct 24 2005
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2021 ThinkLoud, Inc.
Terms of Use
| Privacy Policy