Sciweavers

26 search results - page 1 / 6
» Construction of Scale-Free Networks with Partial Information
Sort
View
COCOON
2005
Springer
13 years 10 months ago
Construction of Scale-Free Networks with Partial Information
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...
Jianyang Zeng, Wen-Jing Hsu, Suiping Zhou
P2P
2008
IEEE
184views Communications» more  P2P 2008»
13 years 10 months ago
Ad Hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
Hasan Guclu, Durgesh Kumari, Murat Yuksel
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
13 years 1 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
WIOPT
2011
IEEE
12 years 8 months ago
Network utility maximization over partially observable Markovian channels
Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...
Chih-Ping Li, Michael J. Neely
AAAI
1996
13 years 5 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole