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
  Lorentz, Richard Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 3 of 3 reviews    
  Using evaluation functions in Monte-Carlo tree search
Lorentz R. Theoretical Computer Science 644106-113, 2016.  Type: Article

Recently, the deep learning paradigm became popular as a consequence of the success of Go game playing. Generally, the investigation of two-player games can be considered a good laboratory for experimenting with algorithms that pursue ...
...
Dec 28 2016  
  Recursive algorithms
Lorentz R., Ablex Publishing Corp., Norwood, NJ, 1994.  Type: Book (9781567500370)

This introduction to recursive algorithms and their complexity is suitable for CS1 and CS2 students. It can be used as a reference book for basic algorithms on recursive data structures and for basic program analysis techniques. Its st...
...
Sep 1 1995  
  An O(n log n) algorithm for finding all repetitions in a string
Main M., Lorentz R. Journal of Algorithms 5(3): 422-432, 1984.  Type: Article

Given a string of symbols from an alphabet, there are various questions concerning whether the string contains any repetitions; that is, substrings of symbols that are repeated adjacently. The problem of finding all repetitions in an a...
...
Jul 1 1985  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy