272 search results - page 7 / 55 » A Game-Theoretic Approach to Constraint Satisfaction |
104
click to vote
AISC
2004
Springer
15 years 3 months ago
2004
Springer
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...
ICCD
2007
IEEE
15 years 6 months ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
105
click to vote
WLP
2004
Springer
15 years 3 months ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
122
click to vote
JMLR
2012
13 years 4 days ago
2012
In this paper we propose a new approach for semi-supervised structured output learning. Our approach uses relaxed labeling on unlabeled data to deal with the combinatorial nature ...
KBSE
1997
IEEE
15 years 1 months ago
1997
IEEE
This paper discusses our approach to the problem of refining high-level simulation specifications. Our domain is simulated combat training for tank platoon members. Our input is a...