The Art of Problem-Solving in Software Engineering:How to Make MySQL Better (目录) 王斌 TCPCopy,MySQL顶级内核专家,打算干翻MySQL6 人赞同了该文章 Table of Contents Preface. i Who This Book Is For?. i Outline of This Book. ii References and Further Reading. iii Special Terminology Explanation...
The extended partitioning problem is the joint problem of mapping nodes in a precedence graph to hardware or software, and within each mapping, selecting an appropriate implementation for each node. The end-goal is to minimize the hardware area, subject to architectural and performance constraints. ...
We define the extended partitioning problem as the joint determination of the mapping (hardware or software), the implementation option (called implementation bin), as well as the schedule, for each node, so that the overall area allocated to nodes in hardware is minimum and a deadline ...
Hardware/software partitioning is a crucial problem in hardware/software co-design. In this paper, we deeply investigate genetic algorithm (GA) for hardwar... L Li,H He,D Qiang,... - Second International Conference on Intelligent System Design & Engineering Application 被引量: 9发表: 0年 A...
, 2006), and set partitioning approaches (Baldacci et al., 2008). Heuristic methods, such as iterative improvement, evolutionary algorithms, and hybrid metaheuristic schemes have also made significant contributions; however, most of them fail to provide a good compromise between solution quality and ...
Angel E, Zissimopoulos V (1998) Autocorrelation coefficient for the graph bipartitioning problem. Theor Comp Sci 191:229–243 CrossRef Angel E, Zissimo... H Waeselynck,TF Abdellatif-Kaddour - 《Empirical Software Engineering》 被引量: 46发表: 2007年 A new approach to robust clustering by...
Editors and Affiliations Department of Industrial & Systems Engin, University of Florida, Gainesville, FL, USA Panos M. Pardalos Departmentl of Industrial Engineering, University of Pittsburgh, Pittsburgh, PA, USA Oleg A. Prokopyev Rights and permissions ...
A variable depth search procedure (abbreviated as VDS) is a generalization of the local search method, which was first successfully applied by Lin and Kernighan to the traveling salesman problem and the graph partitioning problem. The m... M Yagiura,T Yamaguchi - Springer US 被引量: 71发表:...
(larger than |Xi |2 = ℓ4/3): Each such troublesome triplet (we call it a bad triplet) will be further partitioned into ki,j ⌈|Zi,j | /ℓ4/3⌉ smaller subproblems, by partitioning Zi,j into ki,j pieces of size ℓ4//3 each (except that possibly the ki,j-th piece ...
In order to improve the problem resolution, methods based on the partitioning of the problem representative matrix were developed (Sargent, 1978; Shacham, 1984), but the application on large problems was still not satisfactory (Martinez and Puigjaner, 1988). Furthermore, otherlinearization methodswere...