Sciweavers

1738 search results - page 200 / 348
» An algorithmic framework for network reconstruction
Sort
View
CSCLP
2007
Springer
16 years 20 days ago
Generalizing Global Constraints Based on Network Flows
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
Igor Razgon, Barry O'Sullivan, Gregory M. Provan
ICNP
2000
IEEE
15 years 11 months ago
Generalized Load Sharing for Packet-Switching Networks
—In this paper, we extend the load sharing framework to study how to effectively perform flow-based traffic splitting in multipath communication networks. The generalized load sh...
Ka-Cheong Leung, Victor O. K. Li
MOBIHOC
2008
ACM
16 years 6 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
HPDC
2006
IEEE
16 years 16 days ago
Peer to peer size estimation in large and dynamic networks: A comparative study
As the size of distributed systems keeps growing, the peer to peer communication paradigm has been identified as the key to scalability. Peer to peer overlay networks are charact...
Erwan Le Merrer, Anne-Marie Kermarrec, Laurent Mas...
ATAL
2005
Springer
16 years 20 hour ago
Optimal design in collaborative design network
We consider a multiagent system whose task is to aid componentcentered design by collaborative designers in a supply chain. In the earlier work, collaborative design networks are ...
Y. Xiang, J. Chen, William S. Havens