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 28 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 Repository record for A complementary heuristic for the unbounded knapsack problem (opens in a new tab)

  2. Multiple-vehicle resource-constrained navigation in the deep ocean

    … Le Ny et al. in [71]. We compare round-robin and greedy heuristic approaches with the Restless Bandit approach in computational experiments. For the subsea equipment delivery example of homogeneous vehicles with depth-varying parameters, a suboptimal quasi-static approximation of the index …

    mit Repository record for Multiple-vehicle resource-constrained navigation in the deep ocean (opens in a new tab)

  3. 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)

  4. Data Procurement for Shortest Paths on Random Graphs

    … the realized edge weights. We evaluate several greedy heuristics, with different lookaheads, for choosing edges. We also prove that any greedy heuristic with lookahead less than the budget has no finite approximation ratio to the optimal policy.

    harvard Repository record for Data Procurement for Shortest Paths on Random Graphs (opens in a new tab)

  5. Deployment, Coverage And Network Optimization In Wireless Video Sensor Networks For 3D Indoor Monitoring

    … in the 3d environment. We develop efficient greedy heuristic solutions that integrate all these aforementioned considerations one by one and can yield high quality results. Based on this, we also propose enhanced depth first search (dfs) algorithms that can not only further improve the …

    mississippi Repository record for Deployment, Coverage And Network Optimization In Wireless Video Sensor Networks For 3D Indoor Monitoring (opens in a new tab)

  6. Information theoretic sensor management

    … this fact, many authors have applied simple heuristics such as greedy or myopic controllers with great success. This thesis studies sensor management problems in which information theoretic quantities such as entropy are utilized to measure detection or estimation performance. The work has …

    mit Repository record for Information theoretic sensor management (opens in a new tab)

  7. Dynamic planning under uncertainty for theater airlift operations

    … our optimization-based approach to one using a greedy heuristic that is representative of the current planning process. Using measures of efficiency and effectiveness, we evaluate and compare the performance of these different approaches. Finally, we adjust selected parameters of our model and …

    mit Repository record for Dynamic planning under uncertainty for theater airlift operations (opens in a new tab)

  8. Investigations into effectively moving people and goods

    … costs. We introduce a marginal cost path-based greedy heuristic that works with a partially time-expanded network to solve large scale real-life instances found in practice. Our approach involves two consolidation improvement heuristics and novel use of iterative refinement within the greedy

    gatech Repository record for Investigations into effectively moving people and goods (opens in a new tab)

  9. Efficient radio resource management in integrated terrestrial and non-terrestrial networks

    … distribution sub-problem. A service-aware greedy heuristic algorithm is proposed to solve the user association sub-problem and its performance compared to the serviceunaware scheme. Simulation results reveal that the service-aware algorithm achieves higher overall network spectrum …

    cape-town Repository record for Efficient radio resource management in integrated terrestrial and non-terrestrial networks (opens in a new tab)

  10. Simplifying The Non-Manifold Topology Of Multi-Partitioning Surface Networks

    … algorithm that invokes the operator following a greedy heuristic. The algorithm is based on a novel, abstract representation of a non-manifold surface as a graph, which allows efficient discovery and scoring of possible surgery operations without the need for explicitly performing the surgeries …

    wustl Repository record for Simplifying The Non-Manifold Topology Of Multi-Partitioning Surface Networks (opens in a new tab)

  11. A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem

    … At each level, we use a variant of the ring heuristic followed by a greedy heuristic to add edges, finally resulting in a complete triangulation of the point set. In our analysis, we reduce the problem of comparing the weight of the candidate and the optimal solutions to a comparison between …

    vt Repository record for A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem (opens in a new tab)

  12. An Integrated Real-Time and Security Scheduling Framework for CPS

    … to a fully polynomial. We also experiment with a greedy-heuristic approach and compare the results of both algorithms.

    vt Repository record for An Integrated Real-Time and Security Scheduling Framework for CPS (opens in a new tab)

  13. Comparison of Scheduling Algorithms for a Multi-Product Batch-Chemical Plant with a Generalized Serial Network

    … of this research are to: 1. modify different heuristic production scheduling algorithms to minimize tardiness for a multi-product batch plant involving multiple processing stages with several out-of-phase parallel machines in each stage; and 2. compare the robustness and performance of these …

    vt Repository record for Comparison of Scheduling Algorithms for a Multi-Product Batch-Chemical Plant with a Generalized Serial Network (opens in a new tab)

  14. Optimized border interdiction

    … the model. Additionally, we provide a modified greedy heuristic to the scheduling formulation that can serve as a tool for dynamically retasking a patrol to interdict enemy forces in real-time after a sensor detects enemy movement. Current planning for these operations are conducted by a staff …

    mit Repository record for Optimized border interdiction (opens in a new tab)

  15. Optimal trees for prediction and prescription

    … decision tree methods is their use of a greedy heuristic for training. The tree is therefore constructed one locally-optimal split at a time, and so the final tree as a whole may be far from global optimality. Motivated by the increase in performance of mixed-integer optimization methods …

    mit Repository record for Optimal trees for prediction and prescription (opens in a new tab)

  16. Dependence-Based Source Level Tracing and Replay for Networked Embedded Systems

    … approaches, such as model checking. Second, a greedy heuristic method is developed to decompose global properties into a set of local ones with the goal of minimizing the communication traffic for state information exchanges. Each local property is checked by a certain sensor node. Third, a …

    purdue-thes Repository record for Dependence-Based Source Level Tracing and Replay for Networked Embedded Systems (opens in a new tab)

  17. Material diversification in pavement management : a technique to proactively deal with an uncertain future

    … and the future cost of maintenance actions. Its greedy heuristic algorithm addresses the inability of the current methods to (a) account for the heterogeneous (e.g., material, design, traffic) nature of pavements (b) scale for the type of real-world contexts that planners intend to use pavement …

    mit Repository record for Material diversification in pavement management : a technique to proactively deal with an uncertain future (opens in a new tab)

  18. Traffic-Aware Channel Assignment for Multi-Transceiver Wireless Networks

    … in the scenarios evaluated. We develop a set of greedy, heuristic algorithms that address the problem of resource- minimized TI assignment, the first component of the traffic-aware assignment. We develop centralized and distributed schemes for nodes to assign channels to their transceivers. These …

    vt Repository record for Traffic-Aware Channel Assignment for Multi-Transceiver Wireless Networks (opens in a new tab)

  19. Algorithms and Low Cost Architectures for Trace Buffer-Based Silicon Debug

    … trace signal interconnection scheme and a new heuristic for trace signal selection based on implication-based correlation are also described. By this approach, we can effectively trace twice as many signals with the same trace buffer width. A SAT-based greedy heuristic is also proposed to prune …

    vt Repository record for Algorithms and Low Cost Architectures for Trace Buffer-Based Silicon Debug (opens in a new tab)

  20. Inventory consideration and management in two supply chain problems

    … techniques, we develop an iterative heuristic method for the problem. An experiment study shows that the proposed procedure performs well in comparison with a lower bound. The operational supply chain problem considered is a multi-channel component replenishment problem in an …

    nus Repository record for Inventory consideration and management in two supply chain problems (opens in a new tab)

Page 1 of 2