5214 search results - page 391 / 1043 » The Online Specialization Problem |
166
click to vote
GECCO
1999
Springer
15 years 11 months ago
1999
Springer
In genetic programming a general consensus is that the population should be as large as practically possible or sensible. In this paper we examine a batch of problems of combinato...
165
click to vote
ISSAC
1999
Springer
15 years 11 months ago
1999
Springer
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
179
click to vote
CASC
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we deal with the problem of the computation of the homology of a finite simplicial complex after an "elementary simplicial perturbation" process such as th...
166
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...
191
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...