Sciweavers

2410 search results - page 159 / 482
» Multiset Ordering Constraints
Sort
View
AAAI
2006
15 years 7 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
Carla P. Gomes, Ashish Sabharwal, Bart Selman
JSAT
2006
134views more  JSAT 2006»
15 years 6 months ago
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
Hossein M. Sheini, Karem A. Sakallah
ICPR
2008
IEEE
16 years 7 months ago
Continuous graph cuts for prior-based object segmentation
In this paper we propose a novel prior-based variational object segmentation method in a global minimization framework which unifies image segmentation and image denoising. The id...
Anders Heyden, Christian Gosch, Christoph Schn&oum...
IDEAS
2007
IEEE
138views Database» more  IDEAS 2007»
16 years 19 days ago
On Transversal Hypergraph Enumeration in Mining Sequential Patterns
The transversal hypergraph enumeration based algorithms can be efficient in mining frequent itemsets, however it is difficult to apply them to sequence mining problems. In this ...
Dong (Haoyuan) Li, Anne Laurent, Maguelonne Teisse...
AI
2004
Springer
15 years 11 months ago
A Hybrid Schema for Systematic Local Search
Abstract. We present a new hybrid constraint solving schema which retains some systematicity of constructive search while incorporating the heuristic guidance and lack of commitmen...
William S. Havens, Bistra N. Dilkina