942 search results - page 134 / 189 » Distance Constraint Satisfaction Problems |
123
click to vote
IJCAI
2007
15 years 4 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
152
click to vote
AAAI
2006
15 years 4 months ago
2006
DTGolog, a decision-theoretic agent programming language based on the situation calculus, was proposed to ease some of the computational difficulties associated with Markov Decisi...
109
click to vote
IAT
2007
IEEE
15 years 9 months ago
2007
IEEE
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
109
click to vote
ICTAI
2007
IEEE
15 years 9 months ago
2007
IEEE
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
134
click to vote
IEEEARES
2007
IEEE
15 years 9 months ago
2007
IEEE
The most important part of a firewall configuration process is the implementation of a security policy by a security administrator. However, this security policy is not designed b...