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 81 for “"heuristic algorithm"”.
-
Robust meta-heuristic algorithm for pattern generation with discrete variables.
Robust meta-heuristic algorithm for pattern generation with discrete variables.
-
A low-cost design of multiservice SDH networks with multiple constraints
… as a graph-partitioning problem, and a heuristic algorithm based on constraints programming satisfaction technology is proposed.
-
A complementary heuristic for the unbounded knapsack problem
As a solution algorithm for 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 …
-
Index design for information retrieval applications using database concepts
… size of query workload, we give polynomial time heuristic algorithm with provable guarantees for a weighted set cover based relaxation of the original problem. This is then combined with an overarching branch-and-bound based optimality preserving state-space search algorithm that efficiently …
-
Optimal resource allocation In base stations for mobile wireless communications
… had the following main aims: To design an exact algorithm for the subcarrier and power allocation problem with rate constraints (SPARC), the objective of which is to maximise total data transmission rate of the entire system. To design an exact algorithm for the fractional subcarrier and power …
-
Optimising Networks For Ultra-High Definition Video
… definition content. Further to this, a novel heuristic algorithm is presented to optimise control of the migration events and destination. The combination of the migration system and heuristic algorithm provides an improved video delivery system, capable of migrating resources during operation …
-
RFID Antenna Coverage Optimization
… Set Covering optimization problem. We develop a heuristic algorithm for this NP-Complete problem. We also develop a computerized system, RFIDMIN, which enables for the automated calculation of the minimum number and location of RFID antennas, given the size of the facility and antenna …
-
Reliability diagnostic strategies for series systems under imperfect testing
… no-defect-found outcomes. Based on the model, a heuristic was developed to construct the cost minimizing testing sequence. The heuristic algorithm utilizes elementary arithmetic computations and has been successfully applied to a variety of problems. Furthermore, the algorithm appears to be …
-
Sequencing policy for a CONWIP production system
… (m*) given the sequence of jobs is provided. A heuristic algorithm is provided for the purpose of determining a sequence to minimize (m*). The algorithm attempts to sequence the jobs to achieve the "best fit" between consecutive jobs so that machine and job idle times are minimized. The …
-
Scheduling of biological samples for DNA sequencing
… operational constraints. Two approaches, namely, heuristic and integer programming have been pursued in this thesis. A heuristic algorithm is proposed to solve the scheduling problem. A variant of the problem involving deterministic arrivals of samples is also considered for comparison purposes. …
-
Bandwidth-sensitive oblivious routing
Traditional oblivious routing algorithms either do not take into account the bandwidth demand, or assume that each flow has its own private channel to guarantee deadlock freedom. Though adaptive routing schemes can react to varying network traffic, they require complicated router designs. In this …
-
Static-task scheduling incorporating precedence constraints and deadlines in a heterogeneous-computing environment / Michael D Niedert
… is NP-complete. Nonetheless, the choice of a heuristic algorithm greatly affects the speed of solution. This work evaluates a greedy algorithm, an A* algorithm, and a simulated annealing algorithm applied to the heterogeneous scheduling problem with deadline and dependency constraints. …
-
Hybrid flow shop scheduling with prescription constraints on jobs
… in an IP solver to solve real based scenarios. A heuristic algorithm is developed for obtaining good solutions quickly. Finally, the heuristic is used to increase the execution speed of the IP solver. This thesis concludes by a discussion on the advantages and disadvantages of each option (IP …
-
Scheduling shared data acquisition for real-time decision making
… is first discussed with a corresponding optimal algorithm. Then, an improved heuristic algorithm based on the insights from the optimal algorithm of the sub-problem is presented. Finally, the new algorithm is evaluated with multiple scheduling parameters and is compared with previous heuristics, …
-
A heuristic for including black box analysis tools into a geometric programming formulation
… iterative optimization methods, we propose a heuristic for including black box analysis codes in a geometric programming framework by utilizing sequential geometric programming (SGP). We demonstrate a heuristic SGP method and apply it to a solar powered aircraft using a black boxed GP …
-
Approximate k-means clustering through random projections
… accelerate any exact, approximate, or heuristic algorithm for these ubiquitous problems. For k-means dimensionality reduction, we provide (1+ [epsilon]) relative error results for random row projections which improve on the (2 + [epsilon]) prior known constant factor approximation …
-
A bi-level programming approach for the shipper-carrier network problem
… commoditytypes. A sensitivity analysis-based heuristic algorithm is proposedto solve the program. An example application of the bi-level programmingapproach analyzes the behavior of two marine terminal operators. Theterminal operators are considered to be under the same Port Authority.The …
-
A discrete equal-capacity p-Median problem
… a chain graph. In the second part we develop an algorithm to solve a p-median problem on a general network. First a heuristic algorithm is used to obtain an upper bound on the problem. Next, we obtain a lower bound on the problem by solving a Lagrangian relaxation of a reformulated problem via a …
-
Routing and Allocation of Unmanned Aerial Vehicles with Communication Considerations
… and open source intelligence through algorithms, software, and automation. Therefore, it is necessary to have autonomous algorithms that route multiple UAVs effectively and efficiently throughout missions and that these are realizable in the real-world given the associated …
Page 1 of 5