729 search results - page 127 / 146 » Solving subgraph isomorphism problems with constraint progra... |
85
Voted
CP
2010
Springer
14 years 7 months ago
2010
Springer
We present two heuristics based on constraint technology that solve the problem of generating air traffic management contingency plans, which are used in the case of a catastrophic...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
62
Voted
CP
2005
Springer
15 years 3 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
FOCS
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
SIAMJO
2010
14 years 7 months ago
2010
Abstract. We present a new “lifting” approach for the solution of nonlinear optimization problems (NLPs) that have objective and constraint functions with intermediate variable...