331 search results - page 22 / 67 » Using Redundant Constraints for Refinement |
CP
1995
Springer
13 years 11 months ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
CADE
2006
Springer
14 years 8 months ago
2006
Springer
It is well-known that the connection refinement of clause tableaux with paramodulation is incomplete (even with weak connections). In this paper, we present a new connection tablea...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
A joint source channel coding scheme for error resilient image transmission is proposed. A practical image coder was introduced in [1] using modified Differential Pulse Coded Modu...
AAAI
2008
13 years 10 months ago
2008
In complex strategic situations decision-making agents interact with many other agents and have access to many pieces of information throughout their play. This usually leads to g...
IPCO
2008
13 years 9 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...