Sciweavers

27 search results - page 5 / 6
» Solving weighted CSP by maintaining arc consistency
Sort
View
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 6 months ago
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
Thanasis Balafoutis, Kostas Stergiou
JSAT
2006
92views more  JSAT 2006»
13 years 6 months ago
A Translation of Pseudo Boolean Constraints to SAT
This paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows unit propagation to maintain generalized arc consistency. In the worst case, the size of the p...
Olivier Bailleux, Yacine Boufkhad, Olivier Roussel
EAAI
2007
154views more  EAAI 2007»
13 years 6 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho
TIP
2008
105views more  TIP 2008»
13 years 6 months ago
Weighted Adaptive Lifting-Based Wavelet Transform for Image Coding
In this paper, a new weighted adaptive lifting (WAL)-based wavelet transform is presented. The proposed WAL approach is designed to solve the problems existing in the previous adap...
Yu Liu, King Ngi Ngan
CPAIOR
2007
Springer
14 years 6 days ago
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
Wafa Karoui, Marie-José Huguet, Pierre Lope...