Sciweavers

1403 search results - page 68 / 281
» On Communication in Solving Distributed Constraint Satisfact...
Sort
View
CP
1998
Springer
15 years 2 months ago
Error-Correcting Source Code
We study how constraint-based static analysis can be applied to the automated and systematic debugging of program errors. Strongly moding and constraint-based mode analysis are tur...
Yasuhiro Ajiro, Kazunori Ueda, Kenta Cho
EMO
2009
Springer
174views Optimization» more  EMO 2009»
15 years 4 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck
AAAI
2010
14 years 11 months ago
Coalition Structure Generation based on Distributed Constraint Optimization
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo, Marius...
ICC
2007
IEEE
145views Communications» more  ICC 2007»
15 years 4 months ago
Distributed Optimization for Utility-Energy Tradeoff in Wireless Sensor Networks
Abstract— Wireless sensor networks (WSNs) are energyconstrained in nature, in this paper, we formulate the problem of data transport in sensor networks as a network utility maxim...
Shengbin Liao, Wenqing Cheng, Wei Liu, Zongkai Yan...
FOCS
2007
IEEE
15 years 4 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx