13841 search results - page 46 / 2769 » Algorithms and Constraint Programming |
83
Voted
CP
2007
Springer
15 years 6 months ago
2007
Springer
The typical constraint store transmits a limited amount of information because it consists only of variable domains. We propose a richer constraint store in the form of a limited-w...
CP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
101
Voted
EAAI
2008
15 years 14 days ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
134
click to vote
TKDE
2012
13 years 2 months ago
2012
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
110
click to vote
STOC
2006
ACM
16 years 21 days ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...