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 15 of 15 for “"Constraint optimization problems"”.

  1. Dynamic Continuous Distributed Constraint Optimization Problems

    The Distributed Constraint Optimization Problem (DCOP) formulation is a powerful tool to model multi-agent coordination problems that are distributed by nature. The formulation is suitable for problems where the environment does not change over time and where agents seek their value assignment from …

    wustl Repository record for Dynamic Continuous Distributed Constraint Optimization Problems (opens in a new tab)

  2. Decomposition and Symmetry in Constraint Optimization Problems

    … that advance search-based algorithms for solving Constraint Optimization Problems (COPs). These techniques exploit structural features common in such problems. In particular, the thesis presents a number of innovative algorithms, and associated data structures, designed to exploit decomposition …

    toronto-retro Repository record for Decomposition and Symmetry in Constraint Optimization Problems (opens in a new tab)

  3. Two agent-based approaches for solving multi-objective multi-constraint optimization problems

    … System (FGAS) to solve Multi-Objective Multi-Constraint Problems (MOMCP), which represent the nature of many real life problems. CGAS gives a generic agent-model for multi-objective multi-constraint problem, while FGAS caters more for distributed multi-objective multi-constraint problem like …

    nus Repository record for Two agent-based approaches for solving multi-objective multi-constraint optimization problems (opens in a new tab) Download file for Two agent-based approaches for solving multi-objective multi-constraint optimization problems (opens in a new tab)

  4. Empirical evaluation of Soft Arc Consistency algorithms for solving Constraint Optimization Problems

    A large number of problems in Artificial Intelligence and other areas of science can be viewed as special cases of constraint satisfaction or optimization problems. Various approaches have been widely studied, including search, propagation, and heuristics. There are still challenging real-world …

    sask Repository record for Empirical evaluation of Soft Arc Consistency algorithms for solving Constraint Optimization Problems (opens in a new tab)

  5. A source localization method in unknown spatial-temporal fields and a constrained particle swarm optimization

    … detection problem we need to solve several constraint optimization problems, it is highly possible to meet the constraint optimization problem in other engineering problem. Thus, in this paper, a new method to deal with equality or inequality constraints in constrained optimization and a new …

    ttu Repository record for A source localization method in unknown spatial-temporal fields and a constrained particle swarm optimization (opens in a new tab)

  6. Adaptive harvest-then-transmit for a two-tier heterogeneous wireless network

    … at all user positions, I formulate multi-constraint optimization problems to maximize the minimum data rate at both tier and network levels, solving the resulting non-convex expressions with an algorithm which incorporates the Perron-Frobenius non-negative matrix theory for alternate …

    manitoba Repository record for Adaptive harvest-then-transmit for a two-tier heterogeneous wireless network (opens in a new tab)

  7. Constraint Solving and Optimizationn Using Nature-Inspired Techniques

    Constraint solving and optimization is tackled by scientists in almost every area, including scheduling and planning, configuration, resource allocation, finance, computational biology and machine learning. Since classical systematic and mathematical methods cannot effectively provide suitable …

    regina Repository record for Constraint Solving and Optimizationn Using Nature-Inspired Techniques (opens in a new tab) Download PDF for Constraint Solving and Optimizationn Using Nature-Inspired Techniques (opens in a new tab)

  8. Dual Constraint Problem Optimization Using A Natural Approach: Genetic Algorithm and Simulated Annealing

    Constraint optimization problems with multiple constraints and a large solution domain are NP hard and span almost all industries in a variety of applications. One such application is the optimization of resource scheduling in a "pay per use" grid environment. Charging for these resources based on …

    unf Repository record for Dual Constraint Problem Optimization Using A Natural Approach: Genetic Algorithm and Simulated Annealing (opens in a new tab) Download PDF for Dual Constraint Problem Optimization Using A Natural Approach: Genetic Algorithm and Simulated Annealing (opens in a new tab)

  9. Dynamical System and Parameter Identification for Power Systems

    … of data, and formulate the estimation problems as rank-constraint optimization problems. Furthermore, the rank-constraint optimization problems are converted to difference of convex programming (DCP) problems and solved by convex iteration. The new convexification technique leads to …

    usf Repository record for Dynamical System and Parameter Identification for Power Systems (opens in a new tab)

  10. Constraint-Based Methods for Macromolecular Structure Prediction and Multi-Conformer Refinement

    … through the development and application of constraint satisfaction formulations, which are effectively solved using iterative projection methods such as Reflect-Reflect-Relax (RRR). We demonstrate how the divide-and-concur framework, when combined with these methods, can successfully tackle …

    cornell Repository record for Constraint-Based Methods for Macromolecular Structure Prediction and Multi-Conformer Refinement (opens in a new tab)

  11. Integrating Probabilistic Reasoning with Constraint Satisfaction

    … probabilistic reasoning is closely related to constraint satisfaction at a formal level, and that this relationship yields effective algorithms for guiding constraint satisfaction and constraint optimization solvers. By taking a unified view of probabilistic inference and constraint reasoning …

    toronto-retro Repository record for Integrating Probabilistic Reasoning with Constraint Satisfaction (opens in a new tab)

  12. A low complexity algorithm for dynamic fair resource allocation in OFDMA systems

    … Essas técnicas são normalmente formuladas como constraint optimization problems, conhecidos por serem NP-hard. Neste trabalho, adotamos uma abordagem heurística para lidar com esse tipo de problema. O objetivo principal é desenvolver uma estratégia de alocação fazendo uso eficiente dos recursos …

    brazil-ufpe Repository record for A low complexity algorithm for dynamic fair resource allocation in OFDMA systems (opens in a new tab)

  13. Preference Elicitation in Constraint-Based Models: Models, Algorithms, and Applications

    Constraint-based models offer powerful approaches for describing and resolving many combinatorial optimization problems in a centralized or distributed environment. In such models, the goal is to find a value assignment to a set of variables given a set of preferences expressed by means of cost …

    wustl Repository record for Preference Elicitation in Constraint-Based Models: Models, Algorithms, and Applications (opens in a new tab)

  14. Speeding up GDL-based distributed constraint optimization algorithms in cooperative multi-agent systems

    … algorithms that are developed to process constraints in multi-agent systems. In particular, Distributed Constraint Optimization Problems (DCOPs) are a widely studied constraint handling framework for coordinating interactions in cooperative multi-agent systems. For the past decade, a …

    soton Download PDF for Speeding up GDL-based distributed constraint optimization algorithms in cooperative multi-agent systems (opens in a new tab)

  15. Planning individual activities through an intelligent calendar

    … for this task. The problem explored is a complex Constraint Optimization Problem and various methods are applied on this problem (such as Constraint Logic Programming and Genetic Algorithms). An algorithm is presented, that produces the best results, based on a combination of the Squeaky Wheel …

    greece Repository record for Planning individual activities through an intelligent calendar (opens in a new tab)