Sciweavers

1578 search results - page 139 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
118
Voted
INFOCOM
2002
IEEE
15 years 7 months ago
A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast
—Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. ...
Ariel Orda, Alexander Sprintson
173
Voted
QCQC
1998
Springer
173views Communications» more  QCQC 1998»
15 years 7 months ago
Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
Amir Fijany, Colin P. Williams
264
Voted
COCOA
2011
Springer
14 years 2 months ago
Algorithmic Aspects of Heterogeneous Biological Networks Comparison
Biological networks are commonly used to model molecular activity within the cell. Recent experimental studies have shown that the detection of conserved subnetworks across several...
Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-B...
NETWORKS
2011
14 years 10 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
WSC
2008
15 years 5 months ago
Approximate dynamic programming: Lessons from the field
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
Warren B. Powell