759 search results - page 133 / 152 » Optimal Graph Search with Iterated Graph Cuts |
100
click to vote
AI
2011
Springer
14 years 4 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
80
Voted
EOR
2008
14 years 9 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
77
Voted
ATMOS
2008
14 years 11 months ago
2008
Abstract. The search for train connections in state-of-the-art commercial timetable information systems is based on a static schedule. Unfortunately, public transportation systems ...
AI
2008
Springer
14 years 9 months ago
2008
Springer
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...