Sciweavers

14158 search results - page 267 / 2832
» Generalized switch-setting problems
Sort
View
TIT
2011
131views more  TIT 2011»
14 years 11 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 5 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 4 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...
EBERNBURG
1990
15 years 8 months ago
Problems of Autonomy and Discontexturality in the Theory of Living Systems
In the theory of living systems any description of self-organizing processes is confronted by a very central problem concerning the role of the system's boundary, i.e., there...
Rudolf Kaehr, E. von Goldammer
ARC
2008
Springer
95views Hardware» more  ARC 2008»
15 years 6 months ago
The Instruction-Set Extension Problem: A Survey
Over the last years, we have witnessed the increased use of Application-Specific Instruction-Set Processors (ASIPs). These ASIPs are processors that have a customizable instruction...
Carlo Galuzzi, Koen Bertels