315 search results - page 8 / 63 » A new heuristic to solve the one-warehouse N-retailer proble... |
HEURISTICS
2002
13 years 8 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
SAGA
2001
Springer
14 years 1 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
FUIN
2010
13 years 6 months ago
2010
Fast plan adaptation is important in many AI-applications. From a theoretical point of view, in the worst case adapting an existing plan to solve a new problem is no more efficien...
AIPS
2011
13 years 6 days ago
2011
Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs...
AIPS
2011
13 years 6 days ago
2011
Conformant planning can be formulated as a path-finding problem in belief space where the two main challenges are the heuristics to guide the search, and the representation and u...