Sciweavers

4860 search results - page 155 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
AAAI
1993
13 years 11 months ago
Hybrid Case-Based Reasoning for the Diagnosis of Complex Devices
A novel approach to integrating case-based reasoning with model-based diagnosis is presented. The main idea is to use the model of the device and the results of diagnostic tests t...
Michel P. Féret, Janice I. Glasgow
JDA
2011
104views more  JDA 2011»
13 years 5 months ago
Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
DGCI
2006
Springer
14 years 1 months ago
Topological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids
In this paper, we address the problem of vectorization of binary images on irregular isothetic grids. The representation of graphical elements by lines is common in document analys...
Antoine Vacavant, David Coeurjolly, Laure Tougne
GECCO
2010
Springer
249views Optimization» more  GECCO 2010»
14 years 8 days ago
Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
Torsten Hildebrandt, Jens Heger, Bernd Scholz-Reit...
DAM
2008
131views more  DAM 2008»
13 years 10 months ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...