Sciweavers

1176 search results - page 191 / 236
» Implicit Abstraction Heuristics
Sort
View
QCQC
1998
Springer
154views Communications» more  QCQC 1998»
15 years 4 months ago
Automated Design of Quantum Circuits
In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in ...
Colin P. Williams, Alexander G. Gray
109
Voted
EMMCVPR
1997
Springer
15 years 4 months ago
Deterministic Annealing for Unsupervised Texture Segmentation
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
Thomas Hofmann, Jan Puzicha, Joachim M. Buhmann
ER
1997
Springer
148views Database» more  ER 1997»
15 years 4 months ago
Intelligent Support for Retrieval and Synthesis of Patterns for Object-Oriented Design
Several decades of software engineering research confirm that effective reuse is the only realistic approach to meeting the ever-increasing demands on the software industry. Over ...
Sandeep Purao, Veda C. Storey
88
Voted
KR
1994
Springer
15 years 4 months ago
An Application of Terminological Logics to Case-based Reasoning
A key problem in case-based reasoning is the representation, organization and maintenance of case libraries. While current approaches rely on heuristic and psychologically inspire...
Jana Koehler
AAIM
2010
Springer
165views Algorithms» more  AAIM 2010»
15 years 4 months ago
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
Christian Ernst, Changxing Dong, Gerold Jäger...