Sciweavers

955 search results - page 74 / 191
» A System for Solving Constraint Satisfaction Problems with S...
Sort
View
CP
2007
Springer
14 years 2 months ago
On Universal Restart Strategies for Backtracking Search
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
Huayue Wu, Peter van Beek
HICSS
2008
IEEE
107views Biometrics» more  HICSS 2008»
14 years 2 months ago
Research on Constraints in Anti-Money Laundering (AML) Business Process in China Based on Theory of Constraints
Anti-money laundering is a pressing issue in today’s economy. With the newly launched Chinese anti-money laundering regulation, this issue has drawn more and more attention from...
Xuan Liu, Pengzhu Zhang
ANOR
2004
116views more  ANOR 2004»
13 years 8 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
IWPC
2000
IEEE
14 years 13 days ago
A Pattern Matching Framework for Software Architecture Recovery and Restructuring
This paper presents a framework for software architecture recovery and restructuring. The user specifies a high level abstraction view of the system using a structured pattern la...
Kamran Sartipi, Kostas Kontogiannis, Farhad Mavadd...
CP
2000
Springer
14 years 12 days ago
Maintaining Arc-Consistency within Dynamic Backtracking
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
Narendra Jussien, Romuald Debruyne, Patrice Boizum...