1071 search results - page 22 / 215 » Programming with enumerable sets of structures |
IPCO
2008
14 years 8 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
CIE
2009
Springer
14 years 10 months ago
2009
Springer
An algebraic field extension of Q or Z/(p) may be regarded either as a structure in its own right, or as a subfield of its algebraic closure F (either Q or Z/(p)). We consider the ...
EDBT
2009
ACM
15 years 1 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...
CPAIOR
2009
Springer
15 years 1 months ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
GECCO
2005
Springer
14 years 12 months ago
2005
Springer
We hypothesize that the relationship between parameter settings, speci cally parameters controlling mutation, and performance is non-linear in genetic programs. Genetic programmin...