881 search results - page 51 / 177 » Solving satisfiability problems with preferences |
PRICAI
1998
Springer
14 years 28 days ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
GFKL
2007
Springer
14 years 2 months ago
2007
Springer
Recommender systems are used by an increasing number of e-commerce websites to help the customers to find suitable products from a large database. One of the most popular techniqu...
ATMOS
2008
13 years 10 months ago
2008
Abstract. Recently, the recoverable robustness model has been introduced in the optimization area. This model allows to consider disruptions (input data changes) in a unified way, ...
FLAIRS
2004
13 years 10 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
COR
2010
13 years 8 months ago
2010
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...