1242 search results - page 85 / 249 » A Computational Complexity Theory in Membrane Computing |
152
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
135
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
204
click to vote
ENTCS
2006
15 years 6 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
130
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
206
click to vote
FOGA
2011
14 years 9 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...