4843 search results - page 135 / 969 » The Shortcut Problem - Complexity and Approximation |
138
click to vote
TAMC
2009
Springer
15 years 9 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
133
click to vote
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
116
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
151
click to vote
AI
2006
Springer
15 years 6 months ago
2006
Springer
Real world multiagent coordination problems are important issues for reinforcement learning techniques. In general, these problems are partially observable and this characteristic ...
105
click to vote
UAI
2001
15 years 4 months ago
2001
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...