881 search results - page 46 / 177 » Solving satisfiability problems with preferences |
AINA
2004
IEEE
14 years 14 days ago
2004
IEEE
In this paper, we propose a personal navigation system (called PNS) which navigates a tourist through multiple destinations efficiently. In our PNS, a tourist can specify multiple...
AAAI
1994
13 years 10 months ago
1994
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
SIGECOM
2004
ACM
14 years 2 months ago
2004
ACM
Often, an outcome must be chosen on the basis of the preferences reported by a group of agents. The key difficulty is that the agents may report their preferences insincerely to m...
ICCBR
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Distributed case-based reasoning architectures have the potential to improve the overall performance of case-based reasoning systems. In this paper we describe a collabor...
CEC
2010
IEEE
13 years 9 months ago
2010
IEEE
Many-objective problems are difficult to solve using conventional multi-objective evolutionary algorithms (MOEAs) as these algorithms rely primarily on Pareto ranking to guide the ...