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 35 for “"Generation Problem"”.

  1. Algebraic closures in complexity theory

    … from these in complexity theory. We classify problems with Boolean circuits and Boolean constraints according to their complexity. We transfer algebraic structures to structural complexity. We use the generation problem to classify important complexity classes.

    wurz-thes Repository record for Algebraic closures in complexity theory (opens in a new tab)

  2. A high-level approach to test generation for VLSI circuits

    The traditional approaches to test generation made use of the gate level representation of the circuit. 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. …

    uiuc Repository record for A high-level approach to test generation for VLSI circuits (opens in a new tab)

  3. Use of architectural-level primitives in system-level diagnosis and speed up of test vector generation

    Test generation is an important part of a circuit as the test vectors are used during the design, manufacture, system integration, and throughout the life-cycle of the circuit in order to detect the presence of defects. The very large scale integration (VLSI) test generation problem has been one of …

    uiuc Repository record for Use of architectural-level primitives in system-level diagnosis and speed up of test vector generation (opens in a new tab)

  4. A Guidance Algorithm for Unmanned Surface Vehicle Exhibiting Sternward Motion

    We propose a new dynamically feasible trajectory generation algorithm that incorporates sternward motion for unmanned surface vehicles. This work is motivated by riverine applications where the operating environment is large and poorly known. We extend a navigation approach for forward path …

    vt Repository record for A Guidance Algorithm for Unmanned Surface Vehicle Exhibiting Sternward Motion (opens in a new tab)

  5. Hierarchical wireless framework for real-time collaborative generation and distribution of telemetry data

    … to the data processing and information generation problem in large urban traffic systems. It addresses the challenge of realtime information generation and dissemination in such systems by designing and investigating a hierarchical real-time information framework. The research work is …

    nott-trent Repository record for Hierarchical wireless framework for real-time collaborative generation and distribution of telemetry data (opens in a new tab)

  6. Lossless convexification of quadrotor motion planning with experiments

    … Using the convexied optimal trajectory generation problem with physical and path constraints, an algorithm is developed that generates fuel optimal trajectories given the initial state and desired final state. As a proof of concept, a quadrotor testbed is developed that utilize a …

    tdl Repository record for Lossless convexification of quadrotor motion planning with experiments (opens in a new tab)

  7. Toward graph layout of large data visualization: algorithms, evaluations and application

    … would benefit from a real-time view of layout generation, which can assist user decision making and improve user experience by introducing interactivity. The literature of constraint resolution and mobile visualization is briefly surveyed to achieve an understanding of the state of the art for …

    uoit Repository record for Toward graph layout of large data visualization: algorithms, evaluations and application (opens in a new tab)

  8. Airline revenue management with dynamic offers : bundling flights and ancillary services

    … One area of interest is Dynamic Offer Generation (DOG), in which airlines respond to every booking request in real-time with a customized set of offers and prices. In these offers, ancillary services may be bundled with the flight. Selecting and pricing these offer sets represents a new …

    mit Repository record for Airline revenue management with dynamic offers : bundling flights and ancillary services (opens in a new tab)

  9. Trajectory planner for agile flights in unknown environments

    … fast algorithms able to solve the trajectory generation problem in real-time in order to be able to react quickly to the changing knowledge of the world and that guarantee safety at all times. In this thesis, we first show the computational intractability of solving the planning problem by …

    mit Repository record for Trajectory planner for agile flights in unknown environments (opens in a new tab)

  10. Behavioral delay fault modeling and test generation

    … of gates in a VLSI circuit, the gate level test generation methodologies may become infeasible for delay test generation. In this work, a new behavioral delay fault model that aims at simplifying the delay test generation problem for digital circuits is presented. The model is defined using VHDL. …

    vt Repository record for Behavioral delay fault modeling and test generation (opens in a new tab)

  11. Topics in Trajectory Generation for Robots

    A fundamental problem in robotics is generating the motion for a task. How to translate a task to motion or a series of movements is a non-trivial problem. The complexity of the task, the structure of the robot, and the desired performance determine the sequence of movements, the path, and the …

    lund Repository record for Topics in Trajectory Generation for Robots (opens in a new tab)

  12. Algorithms for coalition formation in multi-agent systems

    … systems. Central to this endeavour is the problem of determining which of the possible coalitions to form in order to achieve some goal. This usually requires calculating a value for every possible coalition, known as the coalition value, which indicates how beneficial that coalition would …

    soton Repository record for Algorithms for coalition formation in multi-agent systems (opens in a new tab)

  13. Morita-Äquivalenzen in der algorithmischen Darstellungstheorie

    … We furthermore investigate how the encountered generation problem can be dealt with and suggest two new ways to overcome it. Firstly we present new generating sets for the condensed algebra, which are often small enough to be computationally tractable. We also introduce a method which enables us …

    aachen Repository record for Morita-Äquivalenzen in der algorithmischen Darstellungstheorie (opens in a new tab)

  14. Synthesis of planar four-link mechanisms for force generation

    … of an infinite solution set to the force generation problem. Associated sensitivity, static and dynamic analyses allow the designer to quickly evaluate each solution.

    vt Repository record for Synthesis of planar four-link mechanisms for force generation (opens in a new tab)

  15. Techniques for Enhancing Test and Diagnosis of Digital Circuits

    … overhead would be significantly high. Test generation for such circuits is difficult because the fault effect needs to be propagated through the memory. We propose a new technique for testing of circuits with embedded memories. By using SMT solver, we model memory at a high level of …

    vt Repository record for Techniques for Enhancing Test and Diagnosis of Digital Circuits (opens in a new tab)

  16. A new guidance trajectory generation algorithm for unmanned systems incorporating vehicle dynamics and constraints

    We present a new trajectory generation algorithm for autonomous guidance and control of unmanned vehicles from a given starting point to a given target location. We build and update incomplete a priori maps of the operating environment in real time using onboard sensors and compute level sets on …

    vt Repository record for A new guidance trajectory generation algorithm for unmanned systems incorporating vehicle dynamics and constraints (opens in a new tab)

  17. Using GPS data in route choice analysis : case study in Boston

    … from GPS data processing, map matching to the generation of route choice sets. Besides, the Path-Size logit model is implemented to address the modeling issue. In this thesis, I develop a new effective method, which I called Point-Based Local Search Map Matching, to match the consecutive GPS …

    mit Repository record for Using GPS data in route choice analysis : case study in Boston (opens in a new tab)

  18. The testability of regular logic structures

    … built-in self-test as well as automatic test generation for these circuits are discussed. The techniques developed are far more powerful and general than those conceived by previous researchers. A test generation program for iterative logic arrays that is the first of its kind to be written is …

    uiuc Repository record for The testability of regular logic structures (opens in a new tab)

  19. Generating Paraphrases with Greater Variation Using Syntactic Phrases

    Given a sentence, a paraphrase generation system produces a sentence that says the same thing but usually in a different way. The paraphrase generation problem can be formulated in the machine translation paradigm; instead of translation of English to a foreign language, the system translates an …

    byu Repository record for Generating Paraphrases with Greater Variation Using Syntactic Phrases (opens in a new tab)

  20. Evolving Cellular Automata Rules for Maze Generation

    … a large number of mazes pergame. The automatic generation of mazes removes a large time bottleneck in mazerunning game development, the manual creation of mazes by expensive designers. Wetherefore attack the problem of automatically designing mazes using a genetic algorithm.However a genetic …

    unr Repository record for Evolving Cellular Automata Rules for Maze Generation (opens in a new tab)

Page 1 of 2