Sciweavers

3009 search results - page 130 / 602
» The Expressive Rate of Constraints
Sort
View
83
Voted
CVPR
2009
IEEE
1696views Computer Vision» more  CVPR 2009»
16 years 5 months ago
Fast Normalized Cut with Linear Constraints
Normalized Cut is a widely used technique for solving a variety of problems. Although finding the optimal normalized cut has proven to be NP-hard, spectral relaxations can be ap...
Linli Xu (University of Alberta), Wenye Li (Univer...
CSMR
2005
IEEE
15 years 3 months ago
Tracing Cross-Cutting Requirements via Context-Based Constraints
In complex systems, it is difficult to identify which system element is involved in which requirement. In this article, we present a new approach for expressing and validating a ...
Felix Bübl, Michael Balser
CP
2005
Springer
15 years 3 months ago
Specialised Constraints for Stable Matching Problems
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...
Chris Unsworth, Patrick Prosser
85
Voted
ICLP
2005
Springer
15 years 3 months ago
Towards an Integration of Answer Set and Constraint Solving
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
SAT
2004
Springer
115views Hardware» more  SAT 2004»
15 years 3 months ago
Full CNF Encoding: The Counting Constraints Case
Abstract. Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding...
Olivier Bailleux, Yacine Boufkhad