2796 search results - page 113 / 560 » The coolest path problem |
114
Voted
ICT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Most distributed power control algorithms have been proposed assuming constant interference and constant path gain. These considerations may result in lower performance g...
133
click to vote
ICCAD
1999
IEEE
15 years 9 months ago
1999
IEEE
: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and the...
113
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
133
Voted
MICS
2010
14 years 11 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
152
click to vote
TAMC
2009
Springer
15 years 11 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...