2796 search results - page 305 / 560 » The coolest path problem |
156
click to vote
ECCC
2006
15 years 6 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
170
click to vote
AIPS
2009
15 years 7 months ago
2009
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
201
click to vote
JSAC
2006
15 years 6 months ago
2006
ABSTRACT. Network service providers and customers are often concerned with aggregate performance measures that span multiple network paths. Unfortunately, forming such network-wide...
194
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
173
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
In this paper we will develop a method to determine cross sections of arbitrary two-dimensional tubular structures, which are allowed to branch, by means of a Stokes flow based bo...