Statespace Search: Algorithms, Complexity, Extensions, And Applications

Statespace Search: Algorithms, Complexity, Extensions, And Applications

SKU: SONG0387988327 In Stock
Sale price$71.59 Regular price$102.27
Save $30.68
Quantity
Add to wishlist
Add to compare
Shipping & Tax will be calculated at Checkout.
Delivery time: 3-5 business days (USA)
Delivery time: 8-12 business days (International)
15 days return policy
Payment Options

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)

This book is about problem solving. Specifically, it is about heuristic statespace search under branchandbound framework for solving com binatorial optimization problems. The two central themes of this book are the averagecase complexity of heuristic statespace search algorithms based on branchandbound, and their applications to developing new problemsolving methods and algorithms. Heuristic statespace search is one of the fundamental problemsolving techniques in Computer Science and Operations Research, and usually constitutes an important component of most intelligent problemsolving systems. The search algorithms considered in this book can be classified into the category of branchandbound. Branchandbound is a general problemsolving paradigm, and is one of the best techniques for optimally solving computationintensive problems, such as scheduling and planning. The main search algorithms considered include bestfirst search, depth first branchandbound, iterative deepening, recursive bestfirst search, and spacebounded bestfirst search. Bestfirst search and depthfirst branchandbound are very well known and have been used extensively in Computer Science and Operations Research. One important feature of depthfirst branchandbound is that it only requires space this is linear in the maximal search depth, making it very often a favorable search algo rithm over bestfirst search in practice. Iterative deepening and recursive bestfirst search are the other two linearspace search algorithms. Iterative deepening is an important algorithm in Artificial Intelligence, and plays an irreplaceable role in building a realtime gameplaying program.

Shipping & Returns

Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.

Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.

Shipping & Returns

Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.

Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.

Warranty

We provide a 2-year limited warranty, from the date of purchase for all our products.

If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.

This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).

Warranty

We provide a 2-year limited warranty, from the date of purchase for all our products.

If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.

This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).

Secure Payment

Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.

We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.

Secure Payment

Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.

We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.

Related Products

You may also like