Sciweavers

9842 search results - page 139 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
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
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
14 years 1 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler
GECCO
2010
Springer
249views Optimization» more  GECCO 2010»
14 years 5 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...
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
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 10 months ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro