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 123 for “"NP-complete"”.
-
On the Complexity of Scheduling University Courses
… courses is hard, even as hard as solving an NP-Complete problem. There are many papers in the literature that make this assertion but rarely are precise problem definitions provided and no papers were found which offered proofs that the university course scheduling problem being discussed is …
-
An Interactive Tutorial for NP-Completeness
… Complexity Theory, reductions, and the NP-Complete class of problems are considered difficult by students. Numerous algorithm visualizations (AVs) have been developed over the years to portray the dynamic nature of known algorithms commonly taught in undergraduate classes. However, to …
-
Complexity of Minimum Corridor Guarding Problems
… by the guard. These problems are proved to be NP-complete. Keywords: computational complexity, computational geometry, corridor guarding, NP-complete"
-
Branch decompositions and their applications
… Also, many of those real-life problems are NP-hard. One traditional method to solve these problems is by branch and bound while another method is by graph decompositions. In the 1980's, Robertson and Seymour conceived of two new ways to decompose the graph in order to solve these problems. …
-
Hamiltonian cycle and related problems : vertex-breaking, grid graphs, and Rubik's Cubes
… variants of TRVB as polynomially solvable or NP-complete. The TRVB problem is useful when analyzing the complexity of what could be called single-traversal problems, where some space (i.e., a configuration graph or a grid) must be traversed in a single path or cycle subject to local …
-
A Local Search Algorithm Approach to Analyzing the Complexity of Discrete Optimization Problems
… verification of several problems is proven to be NP-complete. These results are extended to show that polynomially computable neighborhood functions have arbitrarily poor local optima.
-
Optimization Strategies for Qos-Sensitive VOD Service Delivery in Cooperative Environments
… that this problem is intractable, since it is NP-complete. We present centralized as well as distributed solutions.
-
A high-level approach to test generation for VLSI circuits
… This test generation problem is known to be NP-Complete for combinational circuits. A high level test generation approach has been designed on the basis of the branch and bound search procedure. This approach contains a data path test generator and a control circuit test generator.
-
Combinatorial optimization by stochastic evolution with applications to the physical design of VLSI circuits
… adaptive algorithm for solving a wide variety of NP-Complete combinatorial problems is developed. The new technique is called Stochastic Evolution (SE). The SE algorithm is applied to Network Bisection, Vertex Cover, Set Partition, Hamilton Circuit, Traveling Salesman, Linear Ordering, Standard …
-
Visibility properties of polygons
… illuminate the interior of a simple polygon is NP-complete. We also discuss the generalization of the above results.
-
Distributed construction of energy-efficient ad hoc wireless broadcast trees
… finding the minimum energy broadcast tree is NP-complete and develop an approximation algorithm, which computes sub-optimal solutions in polynomial time. We present a distributed algorithm that computes all N possible broadcast trees simultaneously with O(N2) message complexity. We compare our …
-
RFID Antenna Coverage Optimization
… 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 specifications. RFIDMIN can be used by …
-
Edge-packing by isomorphic subgraphs
… or when H is a tree; we show the problem is NP-complete otherwise. Also, we propose straightforward greedy polynomial-time approximation algorithms which are at least 1/|E<sub>G</sub>| optimal.
-
Generalized Satisfiability Problems
… the introduction of the complexity classes P and NP and the identification of hardest problems in NP. These hardest problems of NP are nowadays known as NP-complete problems. One prominent example of an NP-complete problem is the satisfiability problem of propositional formulas (SAT). Here we get …
-
Conexão de terminais com limitação de roteadores: complexidade e relação com fluxos e caminhos disjuntos
… at most r routers? ”. The TCP was proved to be NP-complete even when either ` or r is bounded by a constant; conversely, the problem was proved to be polynomial-time solvable if ` and r are both bounded by constants. Later, in 2014, Dourado et al. proposed the strict variant of the TCP which …
-
ΧΕΙΡΟΤΕΡΗ ΚΑΙ ΜΕΣΗ ΣΥΜΠΕΡΙΦΟΡΑ ΠΑΡΑΛΛΗΛΩΝ ΑΛΓΟΡΙΘΜΩΝ ΓΙΑ ΠΡΟΒΛΗΜΑΤΑ ΓΡΑΦΩΝ
… OF A GRAPH COLORING PROBLEM WHICH IS KNOWN TO BE NP-COMPLETE IN THE WORST CASE. THE ALGORITHMS CAN BE CHARACTERIZED IN A STRUCTURALWAY, IN THE SENSE THAT IN ORDER TO SOLVE THE MORE INVOLVED PROBLEMS, WE FIRST GIVE SOLUTIONS TO SOME BASIC UNDERLYING ONES. THIS STRUCTURE SEEMS TO BE IMPORTANT IN THE …
-
Exploiting syntactic relations for question answering
… trees. The general case of this problem is NP-complete; in practice, SMARTQA demonstrates that an optimized implementation of the algorithm can be feasibly used for question answering applications.
-
Applying binary decision diagrams to learn hidden Markov models
… on the variable ordering (a problem known to be NP-complete). Preliminary experiments showed that the BDD size grows exponentially with the size of the input, giving the EM-BDD algorithm the same time complexity as the BW algorithm on average. However, this does not encompass the best-case …
-
Linear-time algorithms for graphs with bounded branchwidth
… into linear-time algorithms to solve several NP-complete graph problems (i.e., INDEPENDENT SET, M AXIMUM CUT, GRAPH COLORING, HAMILTONIAN CYCLE, and DISJOINT PATHS). The linearity is achieved assuming the provision of a branch decomposition of the instance graph. We then modify the framework …
-
Analyzing perspective line drawings using hypothesis based reasoning
… geometry. We show that the problem is NP complete, and that it can be solved using modular inference engines for propagating constraints over the set of world level entities. We also show that theorem proving techniques, with their attendant complexity, are not necessary because the …
Page 1 of 7