749 search results - page 105 / 150 » Dualities for Constraint Satisfaction Problems |
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— This paper develops a hierarchical iterative OSNR algorithm based on a game theory framework. A Nash game is formulated between channels with channel utility related to maximiz...
SIAMCOMP
2000
14 years 10 months ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
121
click to vote
SAC
2006
ACM
14 years 11 months ago
2006
ACM
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
DISOPT
2007
14 years 11 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
103
click to vote
PRICAI
2004
Springer
15 years 4 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...