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 10 of 10 for “"distributed problem solving"”.

  1. A cooperative distributed problem-solving framework

    … describes a framework for cooperative distributed problems solving (CDPS) and how this framework can be used to solve the class of problems comprised of semi-independent sub-problems. The CDPS framework provides speedup over traditional sequential problem solving methods, increased …

    uiuc Repository record for A cooperative distributed problem-solving framework (opens in a new tab)

  2. Distributed problem solving environments for scientific computing

    … is to research the issues involved in creating distributed problem solving environments for scientific computing. As part of our evaluation, we have developed a distributed problem solving environment called DPSolve which combines a very high level language, an interactive X Windows interface …

    vt Repository record for Distributed problem solving environments for scientific computing (opens in a new tab)

  3. An exploration of the diffusion of a new technology from communities of practice perspective: Web services technologies in digital libraries.

    … approach was used to investigate the research problems and data were collected through semi-structured interviews, documentary evidence (e.g., meeting minutes), and a comprehensive member check. The research conducted face-to-face and phone interviews with seven respondents with different job …

    unt Repository record for An exploration of the diffusion of a new technology from communities of practice perspective: Web services technologies in digital libraries. (opens in a new tab)

  4. Simulating the evolution of recruitment behavior in foraging Ants

    … environments in which the majority of foods are distributed homogeneously. We discuss the implications of these models to the understanding of optimal foraging strategy and community dynamics among ants, and potential for application to ACO and other distributed problem-solving systems.

    unm Repository record for Simulating the evolution of recruitment behavior in foraging Ants (opens in a new tab)

  5. Hybrid algorithms for distributed constraint satisfaction.

    A Distributed Constraint Satisfaction Problem (DisCSP) is a CSP which is divided into several inter-related complex local problems, each assigned to a different agent. Thus, each agent has knowledge of the variables and corresponding domains of its local problem together with the constraints …

    rgu Repository record for Hybrid algorithms for distributed constraint satisfaction. (opens in a new tab)

  6. A Multi-Agent System and Auction Mechanism for Production Planning over Multiple Facilities in an Advanced Planning and Scheduling System

    One of the major planning problems faced by medium and large manufacturing enterprises is the distribution of production over various (production) facilities. The need for cross-facility capacity management is most evident in the high-tech industries having capital-intensive equipment and short …

    vt Repository record for A Multi-Agent System and Auction Mechanism for Production Planning over Multiple Facilities in an Advanced Planning and Scheduling System (opens in a new tab)

  7. Combining search strategies for distributed constraint satisfaction.

    Many real-life problems such as distributed meeting scheduling, mobile frequency allocation and resource allocation can be solved using multi-agent paradigms. Distributed constraint satisfaction problems (DisCSPs) is a framework for describing such problems in terms of related subproblems, called a …

    rgu Repository record for Combining search strategies for distributed constraint satisfaction. (opens in a new tab)

  8. Distributed AI-defense for Cyber Threats on Edge Computing Systems

    … and their low cost, IoT devices are often distributed en masse and are not operated in controlled and security-hardened environments. These uncontrolled variables expose physical, network, and application attack opportunities, often using newer and more exploitable protocols with limited …

    tdl Repository record for Distributed AI-defense for Cyber Threats on Edge Computing Systems (opens in a new tab)

  9. K x N Trust-Based Agent Reputation

    In this research, a multi-agent system called KMAS is presented that models an environment of intelligent, autonomous, rational, and adaptive agents that reason about trust, and adapt trust based on experience. Agents reason and adapt using a modification of the k-Nearest Neighbor algorithm called …

    vcu Repository record for K x N Trust-Based Agent Reputation (opens in a new tab)

  10. Knowledge Representation, Communication, and Update In Probability-Based Multiagent Systems

    … in a publisher-subscriber hierarchy. A central problem of message passing in prob- abilistic systems is the so called rumor problem, where cycles in message passing cause redundant influence of beliefs. We develop algorithms to identify and solve the rumor problem in the context of our …

    south-carolina Repository record for Knowledge Representation, Communication, and Update In Probability-Based Multiagent Systems (opens in a new tab)