1403 search results - page 105 / 281 » On Communication in Solving Distributed Constraint Satisfact... |
INFOCOM
2003
IEEE
15 years 3 months ago
2003
IEEE
Abstract— Efficient bandwidth allocation strategy with simultaneous fulfillment of QoS requirement of a user in a mobile cellular network is still a critical and an important p...
P2P
2005
IEEE
15 years 3 months ago
2005
IEEE
Distributed peer-to-peer systems rely on voluntary participation of peers to effectively manage a storage pool. In such systems, data is generally replicated for performance and a...
CP
2005
Springer
15 years 3 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
116
click to vote
MOBICOM
2006
ACM
15 years 4 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...