1700 search results - page 97 / 340 » Combinatorial Pattern Matching |
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
COCOON
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
COMPGEOM
1997
ACM
14 years 2 months ago
1997
ACM
We consider the family of area bisectors of a polygon possibly with holes in the plane. We say that two bisectors of a polygon P are combinatorially distinct if they induce di e...
STOC
2000
ACM
14 years 1 months ago
2000
ACM
We give efficient (polynomial-time) list-decoding algorithms for certain families of errorcorrecting codes obtained by "concatenation". Specifically, we give list-decodi...
CIIA
2009
13 years 11 months ago
2009
Vertical partition is an important technique in database design used to enhance performance in database systems. Vertical fragmentation is a combinatorial optimization problem that...