Sciweavers

1522 search results - page 6 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
CSB
2005
IEEE
129views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Minimal Marker Sets to Discriminate Among Seedlines
Raising seeds for biological experiments is prone to error; a careful experimenter will test in the lab to verify that plants are of the intended strain. Choosing a minimal set of...
Thomas C. Hudson, Ann E. Stapleton, Amy M. Curley
ICMLA
2007
13 years 9 months ago
Learning complex problem solving expertise from failures
Our research addresses the issue of developing knowledge-based agents that capture and use the problem solving knowledge of subject matter experts from diverse application domains...
Cristina Boicu, Gheorghe Tecuci, Mihai Boicu
COCOON
2006
Springer
13 years 11 months ago
The Complexity of Black-Box Ring Problems
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 ...
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
TAMC
2007
Springer
14 years 1 months ago
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
Abstract. We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds app...
Michael Dom, Jiong Guo, Rolf Niedermeier
FOGA
2011
12 years 11 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly