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
  Edelkamp, Stefan Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 3 of 3 reviews    
   BlockQuicksort: avoiding branch mispredictions in Quicksort
Edelkamp S., Weiß A.  Journal of Experimental Algorithmics 24(1): 1-22, 2019. Type: Article

Quite often algorithms with bad worst-case complexity perform better on the average. Quicksort falls into this class. However, one of the drawbacks of Quicksort is that it is vulnerable to branch mispredictions, that is, branch misses. Modern proc...
...
Apr 1 2022  
  Heuristic search: theory and applications
Edelkamp S., Schrödl S., Koenig S.,  Morgan Kaufmann Publishers Inc., San Francisco, CA, 2010. 650 pp. Type: Book (978-0-123725-12-7), Reviews: (2 of 2)

Search algorithms are the basis of solutions to many problems in computer science. Heuristic search uses heuristic knowledge--such as an approximation of the distance or cost to the goal or an evaluation of the values of different states in t...
...
Feb 13 2012  
  Heuristic search: theory and applications
Edelkamp S., Schrödl S., Koenig S.,  Morgan Kaufmann Publishers Inc., San Francisco, CA, 2010. 650 pp. Type: Book (978-0-123725-12-7), Reviews: (1 of 2)

This impressive book is a strong candidate for a reference text in the field of heuristic search. The exhaustive presentation of the subject, the rigorous and homogeneous description of all the arguments, the rich and up-to-date bibliography—...
...
Jan 6 2012  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2022 ThinkLoud, Inc.
Terms of Use
| Privacy Policy