749 search results - page 61 / 150 » Dualities for Constraint Satisfaction Problems |
CP
2004
Springer
15 years 4 months ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
CDB
2004
Springer
15 years 4 months ago
2004
Springer
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
101
Voted
ICASSP
2008
IEEE
15 years 5 months ago
2008
IEEE
Joint linear minimum sum mean-squared error (referred to as MSMSE) transmitter and receiver (transceiver) optimization problems are formulated for multiuser MIMO systems under a s...
AAAI
2000
15 years 11 days ago
2000
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
WG
2004
Springer
15 years 4 months ago
2004
Springer
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...