Sciweavers

146 search results - page 5 / 30
» Consistency Techniques for Numeric CSPs
Sort
View
CPAIOR
2009
Springer
15 years 4 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
IEAAIE
2001
Springer
15 years 2 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
SAT
2010
Springer
174views Hardware» more  SAT 2010»
14 years 8 months ago
A System for Solving Constraint Satisfaction Problems with SMT
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
Miquel Bofill, Josep Suy, Mateu Villaret
INCDM
2007
Springer
97views Data Mining» more  INCDM 2007»
15 years 3 months ago
Clustering by Random Projections
Abstract. Clustering algorithms for multidimensional numerical data must overcome special difficulties due to the irregularities of data distribution. We present a clustering algo...
Thierry Urruty, Chabane Djeraba, Dan A. Simovici
BMCBI
2010
131views more  BMCBI 2010»
14 years 9 months ago
A comparison of approximation techniques for variance-based sensitivity analysis of biochemical reaction systems
Background: Sensitivity analysis is an indispensable tool for the analysis of complex systems. In a recent paper, we have introduced a thermodynamically consistent variance-based ...
Hong-Xuan Zhang, John Goutsias