Sciweavers

4860 search results - page 455 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
CSR
2009
Springer
15 years 10 months ago
Partitioning Graphs into Connected Parts
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
Pim van 't Hof, Daniël Paulusma, Gerhard J. W...
IAT
2009
IEEE
15 years 7 months ago
Offline Planning for Communication by Exploiting Structured Interactions in Decentralized MDPs
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
Hala Mostafa, Victor R. Lesser
CN
2008
117views more  CN 2008»
15 years 4 months ago
Broker-placement in latency-aware peer-to-peer networks
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
PE
2008
Springer
167views Optimization» more  PE 2008»
15 years 3 months ago
Analysis of ratings on trust inference in open environments
Ratings (also known as recommendations) provide an efficient and effective way to build trust relationship in the human society, by making use of the information from others rathe...
Zhengqiang Liang, Weisong Shi
HSNMC
2004
Springer
126views Multimedia» more  HSNMC 2004»
15 years 9 months ago
Hybrid Unicast and Multicast Flow Control: A Linear Optimization Approach
— In this paper, we present a solution to the general problem of flow control for both unicast and multicast IP networks. We formulate a convex optimization problem that can be ...
Homayoun Yousefi'zadeh, Fatemeh Fazel, Hamid Jafar...