330 search results - page 66 / 66 » Diagnosing and Solving Over-Determined Constraint Satisfacti... |
IJCAI
2003
13 years 8 months ago
2003
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
DCOSS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We propose a distributed coalition formation strategy for collaborative sensing tasks in camera sensor networks. The proposed model supports taskdependent node selection ...
DATE
2004
IEEE
13 years 10 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used ...
JACIII
2007
13 years 7 months ago
2007
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...