2796 search results - page 218 / 560 » The coolest path problem |
160
click to vote
VISSYM
2007
15 years 9 months ago
2007
For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far ...
160
click to vote
DAIS
2003
15 years 8 months ago
2003
Communication in distributed applications across a wide area network needs to cope with heterogenous and constantly changing network conditions. A promising approach to address thi...
172
click to vote
EOR
2007
15 years 6 months ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
187
click to vote
ANOR
2008
15 years 6 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
165
click to vote
NETWORKING
2008
15 years 8 months ago
2008
In this article, we provide mechanisms enabling the backup path computation to be performed on-line and locally by the Points of Local Repair (PLRs), in the context of the MPLS-TE ...