136 search results - page 22 / 28 » The Satisfiability Problem for Probabilistic Ordered Branchi... |
ESA
1995
Springer
13 years 11 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
FIW
2009
13 years 5 months ago
2009
One of the most difficult tasks in software development is that features are implemented by changing the code of other features. This problem cannot be solved with existing general...
CP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we propose a new approach that consists of the extended compact genetic algorithm (ECGA) and split-ondemand (SoD), an adaptive discretization technique, to economic...
ICDE
2010
IEEE
13 years 7 months ago
2010
IEEE
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...