16843 search results - page 311 / 3369 » On Generalized Authorization Problems |
192
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
161
click to vote
IJCAI
2003
15 years 8 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
205
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
174
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
184
click to vote
GECCO
2007
Springer
16 years 24 days ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...