2796 search results - page 136 / 560 » The coolest path problem |
145
click to vote
JDA
2010
14 years 12 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
152
click to vote
ISORC
2008
IEEE
15 years 11 months ago
2008
IEEE
The analysis of the worst-case execution time (WCET) requires detailed knowledge of the program behavior. In practice it is still not possible to obtain all needed information aut...
109
click to vote
IROS
2007
IEEE
15 years 11 months ago
2007
IEEE
— This paper considers the problem of allocating tasks among robots that operate on a 3D truss. Each robot is commanded to navigate to a different location for work. When the inf...
121
click to vote
NOMS
2000
IEEE
15 years 9 months ago
2000
IEEE
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
173
click to vote
FOCS
1998
IEEE
15 years 9 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...