Sciweavers

2343 search results - page 288 / 469
» The Locomotive Routing Problem
Sort
View
MASCOTS
2007
15 years 7 months ago
Multiobjective Analysis in Wireless Mesh Networks
Abstract— Wireless Mesh Networks are a scalable and costeffective solution for next-generation wireless networking. In the present work, we consider the Round Weighting Problem (...
Cristiana Gomes, Gurvan Huiban
MMNS
2003
102views Multimedia» more  MMNS 2003»
15 years 7 months ago
A Heuristic Algorithm for the Multi-constrained Multicast Tree
Multicasting is an important communication mechanism for implementing real-time multimedia applications, which usually require the underlying network to provide a number of quality...
Wen-Lin Yang
COR
2008
95views more  COR 2008»
15 years 6 months ago
Good triangulations yield good tours
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
Adam N. Letchford, Nicholas A. Pearson
CCR
2006
117views more  CCR 2006»
15 years 6 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
IOR
2007
82views more  IOR 2007»
15 years 6 months ago
Compensating for Failures with Flexible Servers
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
Sigrún Andradóttir, Hayriye Ayhan, D...