Sciweavers

109 search results - page 18 / 22
» Vertex Ranking with Capacity
Sort
View
PDPTA
1996
14 years 6 days ago
Document Retrieval Performance on Parallel Systems
The problem of eciently retrieving and ranking documents from a huge collection according to their relevance to a research topic is addressed. A broad class of queries is de ned a...
David Hawking
COR
2004
99views more  COR 2004»
13 years 10 months ago
A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics
Fair bandwidth allocation is an important issue in the multicast network to serve each multicast traffic at a fair rate commensurate with the receiver's capabilities and the ...
Chae Y. Lee, Young P. Moon, Young Joo Cho
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 5 months ago
Multicriteria Steiner Tree Problem for Communication Network
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
Mark Sh. Levin, Rustem I. Nuriakhmetov
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
14 years 5 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
SOICT
2010
13 years 5 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...