Sciweavers

55 search results - page 7 / 11
» A Specialized Interior-Point Algorithm for Multicommodity Ne...
Sort
View
MP
2010
99views more  MP 2010»
13 years 5 months ago
Separation, dimension, and facet algorithms for node flow polyhedra
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
Maren Martens, S. Thomas McCormick, Maurice Queyra...
CCR
2008
118views more  CCR 2008»
13 years 7 months ago
A generic language for application-specific flow sampling
Flow records gathered by routers provide valuable coarse-granularity traffic information for several measurement-related network applications. However, due to high volumes of traf...
Harsha V. Madhyastha, Balachander Krishnamurthy
MSS
2003
IEEE
113views Hardware» more  MSS 2003»
14 years 22 days ago
Design and Implementation of Multiple Addresses Parallel Transmission Architecture for Storage Area Network
In this paper, we present a parallel transmission architecture for SAN. By using two schedulers on the destination and source addresses of packets, the load of multiple data flows...
Bin Meng, Patrick B. T. Khoo, T. C. Chong
VISUALIZATION
1992
IEEE
13 years 11 months ago
Display of Scientific Data Structures for Algorithm Visualization
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
William L. Hibbard, Charles R. Dyer, Brian E. Paul
SODA
2001
ACM
93views Algorithms» more  SODA 2001»
13 years 8 months ago
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
David Eppstein