2796 search results - page 43 / 560 » The coolest path problem |
110
click to vote
IWANN
1997
Springer
15 years 4 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
SPAA
2003
ACM
15 years 5 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...
ICCAD
2001
IEEE
15 years 8 months ago
2001
IEEE
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— Assume the reliability of a connection is determined by the number of distinct risks associated with the path. We study the most reliable routing for WDM networks with arbitrar...
RECOMB
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. The interpretation of large-scale protein network data depends on our ability to identify significant sub-structures in the data, a computationally intensive task. Here w...