881 search results - page 46 / 177 » Solving satisfiability problems with preferences |
254
click to vote
AINA
2004
IEEE
15 years 9 months 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...
163
click to vote
AAAI
1994
15 years 7 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...
160
click to vote
SIGECOM
2004
ACM
15 years 11 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...
154
click to vote
ICCBR
2001
Springer
15 years 10 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...
162
click to vote
CEC
2010
IEEE
15 years 7 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 ...