Sciweavers

80 search results - page 12 / 16
» A conflict based SAW method for Constraint Satisfaction Prob...
Sort
View
CP
2003
Springer
15 years 11 months ago
Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
Stefano Bistarelli, Philippe Codognet, Kin Chuen H...
AI
2000
Springer
15 years 5 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
EMSOFT
2010
Springer
15 years 3 months ago
Model-based implementation of real-time applications
Correct and efficient implementation of general real-time applications remains by far an open problem. A key issue is meeting timing constraints whose satisfaction depends on feat...
Tesnim Abdellatif, Jacques Combaz, Joseph Sifakis
SAC
2005
ACM
15 years 11 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
15 years 5 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...