Sciweavers

14165 search results - page 256 / 2833
» The generalized two-server problem
Sort
View
172
Voted
TIT
2011
131views more  TIT 2011»
15 years 1 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson
AAAI
2000
15 years 7 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
MP
2006
138views more  MP 2006»
15 years 6 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
OIR
2007
95views more  OIR 2007»
15 years 5 months ago
Help features in digital libraries: types, formats, presentation styles, and problems
Purpose – The purpose of this paper is to evaluate Help features in digital libraries and identify problems related to their design. Design/methodology/approach – This study s...
Hong (Iris) Xie
IJLIT
2010
67views more  IJLIT 2010»
15 years 4 months ago
Interoperability-Centric Problems: New Challenges and Legal Solutions
Whereas abandonment of detailed regulation is widely asserted to be the true way along with the fluctuations of the business models and emergence of IP-based services, there are s...
Turgut Ayhan Beydogan