3678 search results - page 125 / 736 » On the Stable Paths Problem |
75
Voted
IFIP12
2004
15 years 2 months ago
2004
Scheduling problems overall assume that it is possible to identify stable criteria definitions measuring the quality of alternatives. In real world problems however, this does not ...
99
Voted
EAAI
2010
14 years 7 months ago
2010
A model of honey bee social foraging is introduced to create an algorithm that solves a class of optimal resource allocation problems. We prove that if several such algorithms (&q...
90
Voted
TLCA
2007
Springer
15 years 7 months ago
2007
Springer
In our previous work [17] we have shown that for any ω-algebraic meet-cpo D, if all higher-order stable function spaces built from D are ω-algebraic, then D is finitary. This ac...
108
click to vote
SPAA
2003
ACM
15 years 6 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
107
Voted
ALENEX
2004
15 years 2 months ago
2004
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...