729 search results - page 14 / 146 » Solving subgraph isomorphism problems with constraint progra... |
137
click to vote
ICAL
2011
13 years 9 months ago
2011
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
CP
2001
Springer
15 years 1 months ago
2001
Springer
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
80
Voted
ICLP
2005
Springer
15 years 3 months ago
2005
Springer
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
74
Voted
IDA
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we introduce a simple ant based algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear intege...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...