2370 search results - page 236 / 474 » A Structured Set of Higher-Order Problems |
171
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
169
click to vote
ISBI
2006
IEEE
16 years 5 months ago
2006
IEEE
Work in progress towards modeling shape statistics of multiobject complexes is presented. Constraints defined by the set of objects such as a compact representation of object shap...
138
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
147
click to vote
ICSM
2009
IEEE
15 years 11 months ago
2009
IEEE
Within a large, object-oriented software system it is common to partition the classes into a set of packages, which implicitly serve as a set of coarsely-grained logical design un...
190
click to vote
ICLP
2003
Springer
15 years 9 months ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...