1171 search results - page 19 / 235 » Variable neighborhood search |
AIPS
2004
13 years 8 months ago
2004
LPG is a planner that performed very well in the last International planning competition (2002). The system is based on a stochastic local search procedure, and it incorporates se...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
Capturing the context of a user's query from the previous queries and clicks in the same session may help understand the user's information need. A context-aware approac...
EVOW
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with th...
AUSAI
2004
Springer
14 years 24 days ago
2004
Springer
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...