Sciweavers

290 search results - page 21 / 58
» Balancing Applied to Maximum Network Flow Problems
Sort
View
DCOSS
2006
Springer
15 years 1 months ago
An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks
We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing th...
Aubin Jarry, Pierre Leone, Olivier Powell, Jos&eac...
COCOON
2008
Springer
14 years 11 months ago
Quasi-bicliques: Complexity and Binding Pairs
Abstract. Protein-protein interactions (PPIs) are one of the most important mechanisms in cellular processes. To model protein interaction sites, recent studies have suggested to f...
Xiaowen Liu, Jinyan Li, Lusheng Wang
EOR
2006
107views more  EOR 2006»
14 years 9 months ago
Longest path analysis in networks of queues: Dynamic scheduling problems
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...
ICCS
2005
Springer
15 years 3 months ago
Heuristic Algorithm for Anycast Flow Assignment in Connection-Oriented Networks
Abstract. Replication of content on geographically distributed servers can improve both performance and reliability of the Web service. Anycast is a one-toone-of-many delivery tech...
Krzysztof Walkowiak
ISCC
2003
IEEE
15 years 3 months ago
A Framework for Wireless Ad hoc Networks with a Quasi-Guaranteed Minimum System Lifetime
In previous work, we thoroughly studied the intricate problem of energy conservation in wireless ad hoc networks. Consequently, we proposed a novel framework, namely Quasi-Guarante...
Ahmed M. Safwat, Hossam S. Hassanein, Hussein T. M...