العربية
  • Free & Easy Returns
  • Best Deals
العربية
loader
Wishlist
wishlist
Cart
cart

Partitions: Optimality And Clustering - Volume I: Single-parameter

Now:
AED 623.00 Inclusive of VAT
Free Delivery
noon-marketplace
Get it by 13 - 18 Feb
Order in 8 h 52 m
VIP ENBD Credit Card

emi
Monthly payment plans from AED 52View more details
VIP card

Earn AED 31.15 cashback with the Mashreq noon Credit Card. Apply now

Delivery 
by noon
Delivery by noon
High Rated
Seller
High Rated Seller
Cash on 
Delivery
Cash on Delivery
Secure
Transaction
Secure Transaction
1
1 Added to cart
Add To Cart
Noon Locker
Free delivery on Lockers & Pickup Points
Learn more
free_returns
Enjoy hassle free returns with this offer.
Item as Described
Item as Described
70%
Partner Since

Partner Since

7+ Years
Overview
Specifications
PublisherWorld Scientific Publishing Co Pte Ltd
ISBN 139789812708120
ISBN 10981270812X
AuthorFrank Kwang-ming Hwang
LanguageEnglish
Book DescriptionThe need of optimal partition arises from many real-world problems involving the distribution of limited resources to many users. The “clustering” problem, which has recently received a lot of attention, is a special case of optimal partitioning. This book is the first attempt to collect all theoretical developments of optimal partitions, many of them derived by the authors, in an accessible place for easy reference. Much more than simply collecting the results, the book provides a general framework to unify these results and present them in an organized fashion.Many well-known practical problems of optimal partitions are dealt with. The authors show how they can be solved using the theory ― or why they cannot be. These problems include: allocation of components to maximize system reliability; experiment design to identify defectives; design of circuit card library and of blood analyzer lines; abstraction of finite state machines and assignment of cache items to pages; the division of property and partition bargaining as well as touching on those well-known research areas such as scheduling, inventory, nearest neighbor assignment, the traveling salesman problem, vehicle routing, and graph partitions. The authors elucidate why the last three problems cannot be solved in the context of the theory.
Publication Date12 December 2011
Number of Pages364 pages

Partitions: Optimality And Clustering - Volume I: Single-parameter

Added to cartatc
Cart Total AED 623.00
Loading