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 13 of 13 for “"problem decomposition"”.

  1. An Empirical Investigation into Problem Decomposition Strategies used in Program Design

    … and the effect of certain factors relating to, problem decomposition used in program design. The investigation involved two empirical studies, totalling six separate experiments, in which subjects trained in the broad principles of structured programming were asked to undertake various program …

    aston Repository record for An Empirical Investigation into Problem Decomposition Strategies used in Program Design (opens in a new tab)

  2. A Matrix Approach for Finding Extrema: Problems With Modularity, Hierarchy, and Overlap

    … in many different fields are often confronted by problems arising from such systems. Simple heuristics or even enumeration works quite well on small and easy problems; however, to efficiently solve large and difficult problems, proper decomposition according to the complex system is the key. In …

    uiuc Repository record for A Matrix Approach for Finding Extrema: Problems With Modularity, Hierarchy, and Overlap (opens in a new tab)

  3. Multi-objective particle swarm optimisation: methods and applications.

    Solving real life optimisation problems is a challenging engineering venture. Since the early days of research on optimisation it was realised that many problems do not simply have one optimisation objective. This led to the development of multi-objective optimizers that try to look at the …

    rgu Repository record for Multi-objective particle swarm optimisation: methods and applications. (opens in a new tab)

  4. Model-Centric Interdependent Critical Infrastructure System Recovery Analysis and Metrics

    … system design and operation management. OOAandD problem decomposition is used to derive a natural solution structure that simplifies integration and uses mission priority and mission time constraint relationships to reduce the number of system states that must be evaluated to produce a practical …

    vt Repository record for Model-Centric Interdependent Critical Infrastructure System Recovery Analysis and Metrics (opens in a new tab)

  5. Plausible Inference: A Knowledge-Intensive Approach to Induction (An Application of PI to the Problem of Hidden Homology Modeling)

    … its improved learning performance: (1) PI uses problem-decomposition information. (2) It accepts local bias information on a domain-term by domain-term basis. (3) It allows the user to fashion a task-specific learning system by composing algorithms from a library of learning algorithms, and (4) …

    uiuc Repository record for Plausible Inference: A Knowledge-Intensive Approach to Induction (An Application of PI to the Problem of Hidden Homology Modeling) (opens in a new tab)

  6. Evacuation Network Optimization: Models, Solution Methods and Applications

    … network capacity and connectivity. The core problem posed in this text is a network optimization problem with regard to two lane-based planning strategies: lane reversal on roadway sections and crossing elimination at intersections. These strategies supplement one another by increasing …

    cornell Repository record for Evacuation Network Optimization: Models, Solution Methods and Applications (opens in a new tab)

  7. Development of a scalable real-time Lagrangian particle tracking system for volumetric flow field characterization

    … frameworks based on fine and coarse grain problem decomposition for heterogeneous computing architectures. The first framework is based on exposing task and data parallelism through a streaming pipeline within each multi-core processor node. The second framework is based on pipelining …

    uiuc Repository record for Development of a scalable real-time Lagrangian particle tracking system for volumetric flow field characterization (opens in a new tab)

  8. How micro-evolution can guide macro-evolution: multi-scale search via evolved modular variation

    A divide-and-conquer approach to problem solving can in principle be far more efficient than tackling a problem as a monolithic whole. This type of approach is most appropriate when problems have the type of modular organisation known as near-decomposability, as implicit in many natural and …

    soton Repository record for How micro-evolution can guide macro-evolution: multi-scale search via evolved modular variation (opens in a new tab)

  9. Towards a deeper understanding of hybrid programming

    … level (coarse-grained vs. fine-grained problem decomposition) and with respect to the hybrid programming systems (pure MPI vs. MPI+MPI vs. MPI+OpenMP). I discuss their performance factors such as locality, overhead, efficient use of MPI's derived datatypes, and the serial fraction in …

    uiuc Repository record for Towards a deeper understanding of hybrid programming (opens in a new tab)

  10. Self-Regulated Learning Skills Research in Computer Science: The State of the Field

    … with self-regulate; including time management, problem decomposition, and reflection. Self regulation also tends to be a highly cognitive and internal process making it difficult to observe directly, let alone measure. Which skills should be prioritized for targeted instruction? How could we …

    vt Repository record for Self-Regulated Learning Skills Research in Computer Science: The State of the Field (opens in a new tab)

  11. Real-Time Resource Optimization for Wireless Networks

    … wireless networks in the field. Similarly, many problem-specific heuristic solutions with polynomial-time asymptotic complexities may suffer from a similar fate, if their complexities are not tested in actual wall-clock time. To address the limitations of existing approaches, this dissertation …

    vt Repository record for Real-Time Resource Optimization for Wireless Networks (opens in a new tab)

  12. Novel Approaches for Some Stochastic and Deterministic Scheduling Problems

    … are commonly encountered in machine scheduling problems: uncertainty of problem parameters (in particular, due to job processing times), and batching of jobs for processing on capacitated machines. Our approach to address the uncertainty issue regards the indeterminate parameters as random …

    vt Repository record for Novel Approaches for Some Stochastic and Deterministic Scheduling Problems (opens in a new tab)