[PDF] Top 20 An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem
Has 10000 "An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem" found on our website. Below are the top 20 most common "An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem".
An efficient dynamic programming parallel algorithm for the 0-1 knapsack problem
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet
9
Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem
... Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem Didier El Baz, Moussa Elkihel.. To cite this version: Didi[r] ... Voir le document complet
22
A practical efficient fptas for the 0-1 multi-objective knapsack problem
... In the present work, we are interested in the practical be- havior of a new fptas to solve the approximation version of the 0-1 multi- objective knapsack ...in ... Voir le document complet
12
Exact approaches for the knapsack problem with setups
... of the knapsack problem in which items are partitioned into classes, each characterized by a fixed cost and ...formulations. For each formulation, we design an efficient ... Voir le document complet
30
A parallel tabu search for the unconstrained binary quadratic programming problem
... NTRODUCTION The Unconstrained Binary Quadratic Programming (UBQP) problem is a well-known NP hard problem ...zero, the UBQP problem seeks a subset of items that maximizes ... Voir le document complet
9
An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem
... to the discus- sion on lower bounds for .... The anal- ysis of the computational complexity of some algorithms and the quality of the obtained bounds are discussed in Gafarov, ... Voir le document complet
11
Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem
... = 1, ...to the original algorithm proposed by Bazgan et ...updated for each partial solution in the pool (see condition D3 in Section ...2.2), the supported solutions need only ... Voir le document complet
12
An efficient implementation for the 0-1 multi-objective knapsack problem
... problem. All these methods have been designed for the bi-objective case and cannot be extended in a straightforward way to a higher number of ...on dynamic programming. The main ... Voir le document complet
14
An Efficient Algorithm for the Knapsack Sharing Problem
... enhance the STS approach by introducing some intensifying and diversifying strategies: the resulting algorithm is called MTS (Multiple-depth Tabu ...Search). The rest of the article is ... Voir le document complet
20
TopPI: An efficient algorithm for item-centric mining
... measure the impact of optimizations included in TopPI’s algorithm (Section ...on the execution time. In particular, we evaluate the benefits of the optimized pruning evaluation (Sec- ... Voir le document complet
39
A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
... algorithms for computing a permanent of a matrix. The first breakthrough came from Jerrum and Sinclair [JS89] who constructed a randomized fully polynomial time approximation scheme (FPTAS) for ... Voir le document complet
10
An adaptive group theoretic algorithm for integer programming problems
... Glover, F», "An Algorithm for Solving the Linear Integer Programming Problem Over a Finite Additive Group, with Extensions to Solving General Linear and Certain Nonlinear Integer Problem[r] ... Voir le document complet
182
Quality-Driven Dynamic VVC Frame Partitioning for Efficient Parallel Processing
... [6]. The encoding time of a single frame is not reduced with frame level techniques, ...i.e. the latency is not reduced. In high-level parallelism techniques, the threads operate on continuous ... Voir le document complet
6
An Efficient Algorithm for Cooperative Semi-Bandits
... is the independence number of the network G and Q is the sum over all agents of the probability that the agent is active during a time ...Our algorithm employs an ... Voir le document complet
23
Efficient Calculation of Jacobians Using Dynamic Programming
... 101 - 54602 Villers lès Nancy Cedex France Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu - 35042 Rennes Cedex France Unité de recherche INRIA Rhône-Alpes : 65[r] ... Voir le document complet
38
Inverse spectral problem for radial Schrödinger operator on [0, 1]
... [4] R. Carlson and C. Shubin. Spectral rigidity for radial Schr¨odinger opera- tors. J. Differential Equations, 113(2):338–354, 1994. [5] A. Erd´elyi, W. Magnus, F. Oberhettinger, and F.G. Tricomi. Higher tran- ... Voir le document complet
23
An efficient sampling algorithm for variational Monte Carlo.
... of the electron correlation. The reference energy as- sociated with this wave function is ...and the comparison of the algorithms is given in Table II . The runs were made of 100 random ... Voir le document complet
11
An approximate dynamic programming approach for designing train timetables
... solving the train timetabling problem – the optimal allocation of when each train arrives and departs each station – have relied on Mixed-Integer Programming (MIP) ...propose an ... Voir le document complet
14
An algorithm for the forward kinematics of general 6 D.O.F. parallel manipulators
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet
28
An 0(n2) algorithm for 3D substructure matching of proteins
... Unite´ de recherche INRIA Lorraine, Technopoˆle de Nancy-Brabois, Campus scientifique, 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LE`S NANCY Unite´ de recherche INRIA Rennes, Iri[r] ... Voir le document complet
27
Sujets connexes