4860 search results - page 11 / 972 » SNPs Problems, Complexity, and Algorithms |
KR
2004
Springer
14 years 25 days ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
ALGORITHMICA
2010
13 years 7 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
FOGA
2011
12 years 11 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...