Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 112 for “"Greedy Heuristic"”.

  1. A complementary heuristic for the unbounded knapsack problem

    … the performance analysis of density-ordered greedy heuristic, weight-ordered greedy heuristic, value-ordered greedy heuristic, extended greedy heuristic and total-value heuristic has been done. Empirical experiments on different test problems have been analysed and reported. Problem instances …

    vu-aus Download PDF for A complementary heuristic for the unbounded knapsack problem (opens in a new tab)

  2. A Novel Method For Watermarking Sequential Circuits

    … embedding solutions are: (1) Brute Force and (2) Greedy Heuristic. The greedy heuristic has a computational complexity of O(n log n), where n is the number of states in the watermark graph. The greedy heuristic showed improvements for three of the six encoding schemes used in experimental results. …

    usf Repository record for A Novel Method For Watermarking Sequential Circuits (opens in a new tab)

  3. Bičių kolonijos algoritmo taikymas žaidimo "Path of Exile" pasyvių įgūdžių grafui generuoti ir optimizuoti /

    … For solving this problem, ABC algorithm with greedy heuristic was used. Created software was tested, results were compared with passive skill graphs created by players and conclusions are given.

    vilnius Repository record for Bičių kolonijos algoritmo taikymas žaidimo "Path of Exile" pasyvių įgūdžių grafui generuoti ir optimizuoti / (opens in a new tab)

  4. Efficient Algorithms for Unrelated Parallel Machine Scheduling Considering Time of Use Pricing and Demand Charges

    … Time of Use (TOU) and demand charge pricing. The greedy heuristic and genetic algorithm developed are designed to provide efficient solutions to this problem. The results of these methods are compared to a previously developed integer program (IP) solved using CPLEX with respect to the quality of …

    rit Repository record for Efficient Algorithms for Unrelated Parallel Machine Scheduling Considering Time of Use Pricing and Demand Charges (opens in a new tab)

  5. Multi-Objective Resource Provisioning in Network Function Virtualization Infrastructures

    … linear programming (ILP) optimization and a greedy heuristic meth- ods try to maximize the requests acceptance rate while minimizing costs and implementing trac engineering (TE) load-balancing. Next, these schemes are expanded to perform \risk- aware" virtual function mapping and trac routing …

    usf Repository record for Multi-Objective Resource Provisioning in Network Function Virtualization Infrastructures (opens in a new tab)

  6. Inverted Sequence Identification in Diploid Genomic Scaffold Assembly via Weighted MAX-CUT Reduction

    … to the weighted MAX-CUT problem. We present a greedy heuristic solution which we comparatively assess with other solutions to the contig orientation problem, including an advanced MAX-CUT heuristic. We illustrate how a solution to this problem provides a simple means of simultaneously …

    byu Repository record for Inverted Sequence Identification in Diploid Genomic Scaffold Assembly via Weighted MAX-CUT Reduction (opens in a new tab) Download PDF for Inverted Sequence Identification in Diploid Genomic Scaffold Assembly via Weighted MAX-CUT Reduction (opens in a new tab)

  7. A decision support system for selecting IT audit areas using a capital budgeting approach

    … techniques such as a linear programming model, greedy heuristic, improved greedy heuristic and evolutionary heuristic. The DSS also implements extensions to the standard capital budgeting model to make provision for special management requirements. The performance of the mathematical techniques …

    nwu-za Repository record for A decision support system for selecting IT audit areas using a capital budgeting approach (opens in a new tab)

  8. The Bin Packing Problem with Fragile Objects: Models and Solution Methods

    … a Lagrangian relaxation is applied. Several heuristics are developed to find upper bounds, including a greedy heuristic. The second is a graph-based formulation that is solved directly. A standard data set is used for testing. It is found that the new formulation based on the classical BPP is …

    waterloo Repository record for The Bin Packing Problem with Fragile Objects: Models and Solution Methods (opens in a new tab)

  9. Obstacle-Aware Wireless Video Sensor Network Deployment For 3D Indoor Space Monitoring

    … and Accurate Detection strategy. We propose a greedy heuristic and an enhanced Depth First Search (DFS) algorithm to solve the discrete version problem where the latter, if given enough time can return the optimal solution. We evaluate our solutions with a customized simulator that can emulate …

    mississippi Repository record for Obstacle-Aware Wireless Video Sensor Network Deployment For 3D Indoor Space Monitoring (opens in a new tab)

  10. A hybrid genetic-greedy approach to the skills management problem.

    … to solve through brute force. Already several greedy heuristics have been produced, though their performance degrades for larger data sets. As Genetic Algorithms (GA) are effective for large combinatorial problems, their application to the task assignment problem may prove successful. The …

    louisville Repository record for A hybrid genetic-greedy approach to the skills management problem. (opens in a new tab)

  11. Customer dedicated facilities and inventory sharing in integrated network design and inventory optimization

    … solved instantaneously, and we also identify a greedy heuristic that provides bounds on average within 0.12% of the optimal solution. We observe maximum benefit from inventory sharing when there exists large demand in the area overlapping the time window of both shared facilities and when …

    texas Repository record for Customer dedicated facilities and inventory sharing in integrated network design and inventory optimization (opens in a new tab)

  12. Design and Evaluation of New Search Paradigms and Power Management for Peer-to-Peer File Sharing

    … (or covered) by other hosts. A new set cover heuristic -- called the Random Map Out (RMO) algorithm --is introduced and compared to the well-known Greedy heuristic. The algorithms are evaluated for minimum set cover size and computational complexity (number of comparisons). The RMO algorithm …

    usf Repository record for Design and Evaluation of New Search Paradigms and Power Management for Peer-to-Peer File Sharing (opens in a new tab)

  13. Matching pursuit algorithms with applications in wireless communication systems

    … combinatorial search. For a simpler solution, greedy heuristic algorithms, namely matching pursuit (MP) algorithms are proposed. These algorithms require sequential selection of basis vectors from a set of vectors, termed as dictionary. This dictionary can be undercomplete, overcomplete or …

    ottawa-retro Repository record for Matching pursuit algorithms with applications in wireless communication systems (opens in a new tab)

  14. A computer-assisted final examination scheduling system for the Naval Postgraduate School

    … Postgraduate School. The system is based on a greedy heuristic that produces high quality solutions for 200 examinations in a few minutes on a personal computer. Comparisons between computer constructed schedules and the manual schedule for the 1994 winter quarter show the manual schedule's …

    nps Repository record for A computer-assisted final examination scheduling system for the Naval Postgraduate School (opens in a new tab)

  15. An evaluation of site selection methods in the Assiniboine Delta region of Manitoba

    … been previously established within the region. A greedy heuristic algorithm and a simulated annealing algorithm were utilized to select candidate areas for conservation that would fulfill specific conservation goals. The two algorithms were free to select sites from crown lands or a combination of …

    manitoba Repository record for An evaluation of site selection methods in the Assiniboine Delta region of Manitoba (opens in a new tab)

  16. The early-tardy distinct due date machine scheduling problem with job splitting

    … genetic algorithm, simulated annealing and a new greedy heuristic to variations of the problem. The heuristics were run on test cases using 200 jobs on 5 parallel machines, with a schedule length of 2000 time units. The jobs had machine- and sequence-independent setup times. Special jobs - …

    nus Repository record for The early-tardy distinct due date machine scheduling problem with job splitting (opens in a new tab) Download file for The early-tardy distinct due date machine scheduling problem with job splitting (opens in a new tab)

  17. Determination of Selective reenlistment Bonus multipliers in the United States Marine Corps.

    … The best feasible solution is improved using a greedy heuristic to apportion unexpended funds. A FORTRAN 77 computer program implements the procedure. Data for FY86 yields a 0-1 integer program with 4895 binary variables and 980 constraints. A solution within .01% of optimality is obtained on an …

    nps Repository record for Determination of Selective reenlistment Bonus multipliers in the United States Marine Corps. (opens in a new tab)

  18. A High-Throughput Energy-Efficient Passive Optical Network with Multiple Planes

    … as a programming problem and design three greedy heuristic algorithms. Finally, simulation results show our scheme outperforms the previous POXN in terms of throughput and mean packet delay.

    carleton Repository record for A High-Throughput Energy-Efficient Passive Optical Network with Multiple Planes (opens in a new tab)

  19. Optimization models for placing nurse recruiters

    … problem optimally is not practical. Instead, a greedy heuristic was used. Based on several small random problems, the heuristic provides solutions within 5% of optimality on the average. To illustrate possible uses of solutions to the problem, several applications are also discussed

    nps Repository record for Optimization models for placing nurse recruiters (opens in a new tab)

Page 1 of 6