44 search results - page 4 / 9 » Using Constraint Programming for Solving Distance CSP with U... |
MOZ
2004
Springer
14 years 19 days ago
2004
Springer
Abstract. Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and prefere...
IFIP12
2004
13 years 8 months ago
2004
The recent deregulation occurred in the public railway sector in many parts of the world has increased the awareness of this sector of the need for quality service that must be oer...
CP
2003
Springer
14 years 15 days ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
TCSV
2010
13 years 2 months ago
2010
We propose a new distance measure for face recognition and human gait recognition. Each probe image (a face image or an average human silhouette image) is represented as a set of ...
CONSTRAINTS
2000
13 years 7 months ago
2000
The vehicle routing problem (VRP) is a variant of the familiar travelling salesperson problem (TSP). In the VRP we are to perform a number of visits, using a number of vehicles of ...