255 search results - page 37 / 51 » Genetic Algorithm for Restrictive Channel Routing Problem |
117
click to vote
INFOCOM
1998
IEEE
15 years 4 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
100
click to vote
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
Abstract— Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
100
click to vote
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
Due to hidden terminals and a dynamic topology, contention among stations in an ad-hoc network is not homogeneous. Some stations are at a disadvantage in opportunity of access to ...
ICALP
2009
Springer
16 years 2 days ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...