805 search results - page 77 / 161 » Enumerating All Solutions for Constraint Satisfaction Proble... |
118
click to vote
COR
2007
15 years 4 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
159
click to vote
AAIM
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
171
click to vote
AAMAS
2011
Springer
14 years 11 months ago
2011
Springer
In this paper, we consider algorithms for distributed constraint optimisation problems (DCOPs). Using a potential game characterisation of DCOPs, we decompose six distributed DCOP...
138
click to vote
PODS
1999
ACM
15 years 8 months ago
1999
ACM
Despite advances in recent years in the area of mandatory access control in database systems, today's information repositories remain vulnerable to inference and data associa...
136
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Interactive configuration is the concept of assisting a user in selecting values for parameters that respect given constraints. It was originally inspired by the product configurat...