2343 search results - page 370 / 469 » The Locomotive Routing Problem |
158
click to vote
CONEXT
2007
ACM
15 years 8 months ago
2007
ACM
The perception of future wireless mesh network (WMN) deployment and usage is rapidly evolving. WMNs are now being envisaged to provide citywide "last-mile" access for nu...
131
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
A major challenge in efficiently solving distributed resource allocation problems is to cope with the dynamic state changes that characterise such systems. An effective solution t...
185
Voted
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
143
click to vote
GD
2006
Springer
15 years 8 months ago
2006
Springer
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
137
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
In many industrial applications, the dynamic control of queuing and routing presents difficult challenges. We describe a novel ant colony control system for a multiobjective sorti...