[PDF] Top 20 An LC branch-and-bound algorithm for the module assignment problem
Has 10000 "An LC branch-and-bound algorithm for the module assignment problem" found on our website. Below are the top 20 most common "An LC branch-and-bound algorithm for the module assignment problem".
An LC branch-and-bound algorithm for the module assignment problem
... In this paper we present an LC (Leas Cost) branch-and-bound algorithm to fiid an optimal assignment that minimizes the sum of execution costs and communication c[r] ... See full document
11
Parallelised branch-and-bound algorithm for raster-based landfill siting
... one for the server side and the other for client ...after the Perl program on the sever computer is executed, it initiates the programs on all client computers ... See full document
12
Improved branch and bound algorithm for detecting SNP-SNP interactions in breast cancer
... However, the computational load can be excessive when dealing with more than 10 polymorphisms ...exclusion for missing SNP data, i.e., only those subjects for which all SNPs are identified (in a ... See full document
4
A branch-and-bound algorithm for makespan minimization in differentiation flow shops
... considered the F(1, m) problem, which is an extension of the traditional flow- shop scheduling ...problem. The significance of the F(1, m) model lies in the ... See full document
13
MPT-based branch-and-bound strategy for scheduling problem in high-level synthesis
... To select the most efficient path, we propose a heuristic solution based on the following six priority rules and corresponding bounding functions to remove undesirabl[r] ... See full document
8
An optimal algorithm for the maximum-density segment problem
... upper bound. In contrast to the previous simple case, when w max is arbitrary, j may not always be ...Therefore, the first argument of the function call in step 3 of main could be j with ... See full document
15
Genetic algorithm for extended cell assignment problem in wireless ATM network
... 摘要: this paper, we investigate the extended cell assignment problem which optimally assigns new and split cells in PCS (Personal Communication Service) to switches in a wireless ATM n[r] ... See full document
1
A genetic algorithm for solving dual homing cell assignment problem of the two-level wireless ATM network
... investigate the optimal assignment problem, which assigns cells in Personal Communication Service to switches on Asynchronous Transfer Mode network in an optimum ...manner. The cost has ... See full document
1
A genetic algorithm for solving dual-homing cell assignment problem of the two-level wireless ATM network
... Computer and Information Science, National Chiao-Tung University, 1001 Ta Hsueh Road, Hsinchu 30050, Taiwan, ROC Received 3 September 2001; revised 11 March 2002; accepted 27 March 2002 Abstract In this paper, we ... See full document
12
Algorithms for an FPGA switch module routing problem with application to global routing
... 2. An infeasible FPGA routing instance. algorithm, in the worst case, does not run in polynomial time, experimental results consistently show that our algorithm is very efficient for ... See full document
15
A Hybrid Genetic Algorithm Applied to Weapon-Target Assignment Problem
... considered, the crossover probability P c =0.8 and the mutation probability P m ...=0.4, and γ =0.5 for SA. In this paper, first scenario is to test the performance for ... See full document
10
An efficient algorithm for finding the D-stability bound of discrete singularly perturbed systems with multiple time delays
... cient algorithm for ® nding the D-stability bound of discrete singularly perturbed systems with multiple time delays FENG-HSIAG HSIAO ² , SHING-TAI PAN ³ and CHING-CHENG TENG§ In this ... See full document
18
Branch-and-bound task allocation with task clustering-based pruning
... allocation algorithm that aims at finding an optimal task assignment for any parallel programs on a given machine ...configuration. The theme of the approach is to traverse a ... See full document
18
Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
... improve the effi- ciency of nearest neighbor search by applying data trans- ...that the Euclidean distance calculated at level l in the LB-tree is the distance in the subspace of ... See full document
16
An optimal algorithm for the minimum disc cover problem
... Abstract The minimum disc cover can be used to construct a dominating set on the fly for energy-efficient communications in mobile ad hoc networks, but the approach used to compute the ... See full document
14
Branch-and-Bound
... 13 使用 Branch-and-bound 之廣度優先搜尋法來解決 0-1 背包問 題 問題：給定 n 個物件及其個別 weight 與 profit 值 ( 皆為正整數 ) 。 給定 W 值。在總重量不超過 W 的條件下，找出一組物件 使其總獲益是最大的。 ... See full document
31
ENHANCING BRANCH-AND-BOUND METHOD FOR STRUCTURAL OPTIMIZATION
... Five criteria for the branching order of the design variables [(I) minimum clearance; (2) maximum clearance; (3) mini- mum clearance difference; (4) maximum clearance differ- ence; and ([r] ... See full document
7
GENETIC ALGORITHMS FOR THE MODULE ORIENTATION PROBLEM
... The problem of fmding the optimal flip for a given set of modules with minimium total wire length is called the module orientation problem.. It has been proved to be N[r] ... See full document
2
An almost-linear time and linear space algorithm for the longest common subsequence problem
... to the longest common subsequence problem. The dynamic programming approach takes quadratic time but linear space, while the nondynamic-programming approach takes less time but more ...of ... See full document
5
An Optimal Algorithm for the Range Maximum-Sum Segment Query Problem
... locate the biologically meaningful segments, like conserved regions or GC-rich regions in DNA ...residue, and then look for the maximum-sum or maximum-average segment [3, 5, ... See full document
9
相關主題