344 search results - page 29 / 69 » The Directed Minimum Latency Problem |
EUROGP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In this contribution we investigate the influence of different variation effects on the growth of code. A mutation-based variant of linear GP is applied that operates ...
126
click to vote
IMCSIT
2010
14 years 9 months ago
2010
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
113
click to vote
ALGORITHMICA
2006
14 years 12 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract— We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the...
STACS
2001
Springer
15 years 4 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...