語系:
繁體中文
English
說明(常見問題)
圖資館首頁
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Partitionsoptimality and clustering /
~
Hwang, Frank.
Partitionsoptimality and clustering /
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
PartitionsFrank K. Hwang, Uriel G. Rothblum.
其他題名:
optimality and clustering /
作者:
Hwang, Frank.
其他作者:
Rothblum, Uriel G.
出版者:
Singapore ;World Scientific Pub. Co.,c2012.
面頁冊數:
xi, 350 p. :ill.
標題:
Partitions (Mathematics)
電子資源:
http://www.worldscientific.com/worldscibooks/10.1142/6518#t=toc
ISBN:
9789812770158 (electronic bk.)
Partitionsoptimality and clustering /
Hwang, Frank.
Partitions
optimality and clustering /[electronic resource] :Frank K. Hwang, Uriel G. Rothblum. - Singapore ;World Scientific Pub. Co.,c2012. - xi, 350 p. :ill.
Includes bibliographical references (p. 341-346) and index.
The 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.
Electronic reproduction.
Singapore :
World Scientific Publishing Co.,
2012.
System requirements: Adobe Acrobat Reader.
ISBN: 9789812770158 (electronic bk.)Subjects--Topical Terms:
239773
Partitions (Mathematics)
LC Class. No.: QA165
Dewey Class. No.: 512.73
Partitionsoptimality and clustering /
LDR
:02396nmm a2200277 a 4500
001
345648
003
WSP
005
20120209155826.0
006
m d
007
cr cuu|||uu|||
008
121106s2012 si a sb 001 0 eng d
020
$a
9789812770158 (electronic bk.)
020
$z
981270812X (hbk.)
020
$z
9789812708120 (hbk.)
035
$a
00002581
040
$a
WSPC
$b
eng
$c
WSPC
050
4
$a
QA165
082
0 4
$a
512.73
$2
22
100
1
$a
Hwang, Frank.
$3
192275
245
1 0
$a
Partitions
$h
[electronic resource] :
$b
optimality and clustering /
$c
Frank K. Hwang, Uriel G. Rothblum.
260
$a
Singapore ;
$a
Hackensack, N.J. :
$b
World Scientific Pub. Co.,
$c
c2012.
300
$a
xi, 350 p. :
$b
ill.
504
$a
Includes bibliographical references (p. 341-346) and index.
520
$a
The 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.
533
$a
Electronic reproduction.
$b
Singapore :
$c
World Scientific Publishing Co.,
$d
2012.
$n
System requirements: Adobe Acrobat Reader.
$n
Mode of access: World Wide Web.
$n
Available to subscribing institutions.
650
0
$a
Partitions (Mathematics)
$3
239773
700
1
$a
Rothblum, Uriel G.
$3
575691
710
2
$a
World Scientific (Firm)
$3
575130
776
1
$z
981270812X (hbk.)
776
1
$z
9789812708120 (hbk.)
856
4 0
$u
http://www.worldscientific.com/worldscibooks/10.1142/6518#t=toc
筆 0 讀者評論
全部
電子館藏
館藏
1 筆 • 頁數 1 •
1
條碼號
館藏地
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
000000074803
電子館藏
1圖書
電子書
EB QA165 c2012
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
多媒體檔案
http://www.worldscientific.com/worldscibooks/10.1142/6518#t=toc
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入