2796 search results - page 190 / 560 » The coolest path problem |
182
click to vote
IJCAI
1989
15 years 7 months ago
1989
In this paper we describe a new approach to the problem of path planning with moving obstacles. Our approach is based on the maneuvering board method commonly used for nautical na...
207
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
148
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Although multi-objective GA (MOGA) is an efficient multiobjective optimization (MOO) method, it has some limitations that need to be tackled, which include unguaranteed uniformity...
186
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
195
click to vote
TON
2010
15 years 1 months ago
2010
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...