Newsletter   Secure Checkout   View Cart (0 items)  
Search:    Welcome Guest! Save up to 30-40% on most items with our awesome everyday discounts!

Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series) [Hardcover]

Our Price $ 111.30  
Retail Value $ 159.00  
You Save $ 47.70  (30%)  
Item Number 231403  
Buy New $111.30
Out Of Stock!
Currently Out Of Stock
Currently unavailable...

Item description for Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series) by Wil Michiels...

Local search has been applied successfully to a diverse collection of optimization problems. It's appreciated for its basic conceptual foundation, its general applicability, and its power to serve as a source for new search paradigms. The typical characteristics of combinatorial optimization problems to which local search can be applied, its relation to complexity theory, and the combination with randomized search features have led to a wealth of interesting theoretical results. However, these results are scattered throughout the literature.

This is the first book that presents a large collection of theoretical results in a consistent manner, thus providing the reader with a coherent overview of the achievements obtained so far, but also serving as a source of inspiration for the development of novel results in the challenging field of local search.

Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at!

Item Specifications...

Pages   238
Est. Packaging Dimensions:   Length: 9.3" Width: 6.1" Height: 0.7"
Weight:   1.15 lbs.
Binding  Hardcover
Release Date   Feb 2, 2007
Publisher   Springer
ISBN  3540358536  
ISBN13  9783540358534  

Availability  0 units.

More About Wil Michiels

Register your artisan biography and upload your photo! Are You The Artisan or Author behind this product?
Improve our customers experience by registering for an Artisan Biography Center Homepage.

Product Categories

1Books > Subjects > Business & Investing > Management & Leadership > Operations Research
2Books > Subjects > Computers & Internet > Computer Science > Artificial Intelligence > Computer Mathematics
3Books > Subjects > Computers & Internet > Computer Science > Artificial Intelligence > General
4Books > Subjects > Computers & Internet > Computer Science > Artificial Intelligence > Heuristic & Constrained Search
5Books > Subjects > Computers & Internet > Computer Science > Artificial Intelligence > Theory of Computing
6Books > Subjects > Computers & Internet > General
7Books > Subjects > Computers & Internet > Programming > Algorithms > General
8Books > Subjects > Computers & Internet > Programming > Software Design > Performance Optimization
9Books > Subjects > Professional & Technical > Professional Science > Mathematics > Applied > Linear Programming
10Books > Subjects > Science > Mathematics > Applied > Linear Programming
11Books > Subjects > Science > Mathematics > General

Reviews - What do customers think about Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)?

multicore scheduling is one major usage  Nov 13, 2007
The authors survey a bunch of classic and important problems in computation. Travelling salesman, machine scheduling and graph colours amongst others. There have been decades of research into these. Certainly, earlier texts have also arisen, that attempt to summarise this research. Perhaps the attraction of this book is its recent vintage.

It goes into the main methods used. Like simulated annealing, and the Metropolis Monte Carlo algorithm. There are theories of how to estimate the computational complexity of the methods. Measured as a function of the problem size. With a key idea being how to efficiently search a "small" neighbourhood of a parameter space. Since it is impractical to exhaustively search all possible values, even if this is finite.

The book is certainly very theoretical. But lest you think the problems are abstract, there is one which is increasingly germane in the computing world. Multiprocessor scheduling. Especially since clock speeds are maxing out, due to excessive power consumption amongst other factors. So the other way to improve performance is to migrate to multicores. Now, this might not appear at first to be exactly the multiprocessor scheduling problem. But in fact it is. The issue of how to efficiently use a bunch of cores in the same processor is fundamentally no different.

Write your own review about Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)

Ask A Question or Provide Feedback regarding Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)

Item Feedback and Product Questions
For immediate assistance call 888.395.0572 during the hours of 10am thru 8pm EST Monday thru Friday and a customer care representative will be happy to help you!

Help us continuously improve our service by reporting your feedback or questions below:

I have a question regarding this product
The information above is incorrect or conflicting
The page has misspellings or incorrect grammar
The page did not load correctly in my browser or created an error.

Email Address:
Anti Spam Question. To combat spammers we require that you answer a simple question.
What color is the sky?
Leave This Blank :
Do Not Change This Text :

Add This Product Widget To Your Website

Looking to add this information to your own website? Then use our Product Widget to allow you to display product information in a frame that is 120 pixels wide by 240 pixels high.

    Copy and paste the following HTML into your website and enjoy!

Order toll-free weekdays 10am thru 10pm EST by phone: 1-888-395-0572 (Lines are closed on holidays & weekends.)
Customer Service | My Account | Track My Orders | Return Policy | Request Free Catalog | Email Newsletter

Gift Certificates
RSS Feeds
About Us
Contact Us
Terms Of Use
Privacy Policy