Stochastic Algorithms: Foundations and Applications: Second International Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$60.67
Used and New from Other Sellers
Used and New from Other Sellers
from $23.50
Usually ships in 1-2 business days
(Save 73%)
Other sellers (Paperback)
  • All (7) from $23.50   
  • New (3) from $54.40   
  • Used (4) from $23.50   

Overview

This book constitutes the refereed proceedings of the Second International Symposium on Shastic Algorithms: Foundations and Applications, SAGA 2003, held in Hatfield, UK in September 2003.

The 12 revised full papers presented together with three invited papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are ant colony optimization, randomized algorithms for the intersection problem, local search for constraint satisfaction problems, randomized local search and combinatorial optimization, simulated annealing, probabilistic global search, network communication complexity, open shop scheduling, aircraft routing, traffic control, randomized straight-line programs, and shastic automata and probabilistic transformations.

Read More Show Less

Product Details

  • ISBN-13: 9783540201038
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 11/5/2003
  • Series: Lecture Notes in Computer Science Series , #2827
  • Edition description: 2003
  • Edition number: 1
  • Pages: 172
  • Product dimensions: 9.21 (w) x 6.14 (h) x 0.39 (d)

Table of Contents

Prospects of Quantum Informatics 1
A Converging ACO Algorithm for Stochastic Combinatorial Optimization 10
Optimality of Randomized Algorithms for the Intersection Problem 26
Stochastic Algorithms for Gene Expression Analysis 39
Analysis of a Randomized Local Search Algorithm for LDPCC Decoding Problem 50
Testing a Simulated Annealing Algorithm in a Classification Problem 61
Global Search through Sampling Using a PDF 71
Simulated Annealing for Optimal Pivot Selection in Jacobian Accumuation 83
Quantum Data Compression 98
Who's The Weakest Link? 108
On the Stochastic Open Shop Problem 117
Global Optimization - Stochastic or Deterministic? 125
Two-Component Traffic Modelled by Cellular Automata: Imposing Passing Restrictions on Slow Vehicles Increases the Flow 138
Average-Case Complexity of Partial Boolean Functions 146
Classes of Binary Rational Distributions Closed under Discrete Transformations 157
Author Index 167
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)