1403 search results - page 10 / 281 » On Communication in Solving Distributed Constraint Satisfact... |
138
Voted
AAAI
1994
15 years 4 months ago
1994
97
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
122
Voted
CCS
2001
ACM
15 years 8 months ago
2001
ACM
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
142
Voted
IJCAI
2003
15 years 5 months ago
2003
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
147
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...