1067 search results - page 17 / 214 » Problem Solving in the DISCO Constraint Database System |
CDC
2009
IEEE
14 years 8 days ago
2009
IEEE
We use viability techniques for solving Dirichlet problems with inequality constraints (obstacles) for a class of Hamilton-Jacobi equations. The hypograph of the “solution” is ...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
CPAIOR
2010
Springer
13 years 5 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
MATES
2009
Springer
14 years 2 months ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...
AI
2001
Springer
14 years 1 days ago
2001
Springer
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...