1450 search results - page 107 / 290 » On the Complexity of Hardness Amplification |
EUROGP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...
FSTTCS
2005
Springer
14 years 2 months ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
VLDB
2005
ACM
14 years 2 months ago
2005
ACM
When a private relational table is published using views, secrecy or privacy may be violated. This paper uses a formally-defined notion of k-anonymity to measure disclosure by vi...
WABI
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
WAOA
2005
Springer
14 years 2 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...