5263 search results - page 235 / 1053 » Open Constraint Optimization |
253
click to vote
AIEDAM
2011
14 years 11 months ago
2011
In familiar design domains, expert designers are able to quickly focus on “good designs”, based on constraints they have learned while exploring the design space. This ability ...
165
click to vote
CONSTRAINTS
2010
15 years 4 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
165
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
143
click to vote
SDM
2004
SIAM
15 years 5 months ago
2004
SIAM
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
159
click to vote
JMLR
2006
15 years 4 months ago
2006
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...