9842 search results - page 370 / 1969 » The Complexity of the Matching-Cut Problem |
127
click to vote
CODES
2005
IEEE
15 years 10 months ago
2005
IEEE
Networks-on-Chip (NoCs) have been recently proposed as a promising solution to complex on-chip communication problems. The lack of an unified representation of applications and ar...
133
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
148
click to vote
IWPEC
2004
Springer
15 years 9 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
120
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
174
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...