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 3 of 3 for “"Distributed constraint satisfaction"”.
-
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 …
-
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 …
-
Modifying landscapes with penalties in iterative improvement for solving distributed constraint satisfaction problems.
The recent growth of the internet and distributed computing facilitated by the internet has created more opportunities for collaboration between individuals and organisations. These new forms of collaborative activity put groups of participants in situations where there is a shared objective but at …