Sciweavers

58 search results - page 3 / 12
» Flow algorithms for two pipelined filter ordering problems
Sort
View
ESWA
2008
162views more  ESWA 2008»
13 years 7 months ago
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang
BMCBI
2010
145views more  BMCBI 2010»
13 years 7 months ago
WaveletQuant, an improved quantification software based on wavelet signal threshold de-noising for labeled quantitative proteomi
Background: Quantitative proteomics technologies have been developed to comprehensively identify and quantify proteins in two or more complex samples. Quantitative proteomics base...
Fan Mo, Qun Mo, Yuanyuan Chen, David R. Goodlett, ...
TON
2008
125views more  TON 2008»
13 years 7 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 25 days ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
CIA
2008
Springer
13 years 9 months ago
Filter Allocation Using Iterative ECNP
Network devices can filter traffic in order to protect end-user computers against network worms and other threats. Since these devices have very limited memories and cannot deploy ...
Jan Tozicka, Stepán Urban, Magdalena Prokop...