SLIM21

Sort Order Display Format Items / Page  
 
  Click the serial number on the left to view the details of the item.
 #  AuthorTitleAccn#YearItem Type Claims
1 Thomas Jansen Analyzing evolutionary algorithms: The Computer Science Perspective 024750 2013 Book  
2 Richard Neapolitan Foundations of algorithms 023431 2011 Book  
3 Thomas H. Cormen Introduction to algorithms 021731 2005 Book  
(page:1 / 1) [#3]     
1.    
No image available
TitleAnalyzing evolutionary algorithms: The Computer Science Perspective
Author(s)Thomas Jansen
PublicationHeidelberg, Springer, 2013.
Descriptionx, 255p.
Series(Natural Computing Series)
Abstract Noten this book the author provides an introduction to the methods used to analyze evolutionary algorithms and other randomized search heuristics. He starts with an algorithmic and modular perspective and gives guidelines for the design of evolutionary algorithms. He then places the approach in the broader research context with a chapter on theoretical perspectives. By adopting a complexity-theoretical perspective, he derives general limitations for black-box optimization, yielding lower bounds on the performance of evolutionary algorithms, and then develops general methods for deriving upper and lower bounds step by step. This main part is followed by a chapter covering practical applications of these methods.
ISBN,Price9783642173387 : Euro 84.95(HB)
Classification681.3.06:510.5
Keyword(s)1. ALGORITHMS 2. ANALYSIS 3. COMPLEXITY 4. EBOOK 5. EBOOK - SPRINGER 6. EVOLUTIONARY ALGORITHMS 7. NATURAL COMPUTING
Item TypeBook
Multi-Media Links
Please Click here for eBook
Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
024750   681.3.06:510.5/JAN/024750  On Shelf    
I11984   681.3.06:510.5/JAN/  On Shelf    

+Copy Specific Information
2.     
No image available
TitleFoundations of algorithms
Author(s)Richard Neapolitan;Kumarss Naimipour
Edition4th
PublicationBoston, Jones And Bartlett, 2011.
Descriptionxvi, 627p.
Abstract NoteFoundations of Algorithms offers a well-balanced presentation of algorithm design, complexity analysis of algorithms, and computational complexity. The volume is accessible to mainstream computer science students who have a background in college algebra and discrete structures. To support their approach, the authors present mathematical concepts using standard English and a simpler notation than is found in most texts. A review of essential mathematical concepts is presented in three appendices. The authors also reinforce the explanations with numerous concrete examples to help students grasp theoretical concepts.
ISBN,Price9780763782504 : US $48.00(HB)
Classification681.3.06:510.5
Keyword(s)ALGORITHMS
Item TypeBook

Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
023431   681.3.06:510.5/NEA/023431  On Shelf    

+Copy Specific Information
3.    
No image available
TitleIntroduction to algorithms
Author(s)Thomas H. Cormen;Charles E. Leiserson;Ronald L. Rivest;Clifford Stein
Edition2nd. (#021731); 3rd.(#023066)
PublicationCambridge, MIT Press, 2005.
Descriptionxxi, 1180p.
ISBN,Price9780262531962 : US $58.00
Classification681.3.06:510.5
Keyword(s)1. ALGORITHMS 2. COMPUTER ALGORITHM 3. DATA STRUCTURES 4. GRAPH ALGORITHMS 5. SORTING
Item TypeBook

Circulation Data
Accession#  Call#StatusIssued ToReturn Due On Physical Location
021731   681.3.06:510.5/COR/021731  On Shelf    
023066   681.3.06:510.5/COR/023066  On Shelf    

+Copy Specific Information
(page:1 / 1) [#3]