Randomization Methods in Algorithm Design

Randomization Methods in Algorithm Design

4.11 - 1251 ratings - Source

[113] R. Sosic and J. Gu. A polynomial time algorithm for the n-queens problem. ... Quick n-queen search on VAX and Bobcat machines. CS 547 AI Class ... Efficient search techniques - an empirical study of the n-queens problem. IBM J. Res.

Title:Randomization Methods in Algorithm Design
Author: Panos M. Pardalos, Sanguthevar Rajasekaran, José D. P. Rolim
Publisher:American Mathematical Soc. -

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

How it works:
  • 1. Register a free 1 month Trial Account.
  • 2. Download as many books as you like (Personal use)
  • 3. Cancel the membership at any time if not satisfied.

Click button below to register and download Ebook
Privacy Policy | Contact | DMCA