Sciweavers

10718 search results - page 371 / 2144
» On the Circuit Implementation Problem
Sort
View
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 10 months ago
A Foundational View on Integration Problems
The integration of reasoning and computation services across system and language boundaries has been mostly treated from an engineering perspective. In this paper we take a foundat...
Florian Rabe, Michael Kohlhase, Claudio Sacerdoti ...
CADE
2011
Springer
14 years 6 months ago
Exploiting Symmetry in SMT Problems
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...
David Déharbe, Pascal Fontaine, Stephan Mer...
ICDM
2007
IEEE
149views Data Mining» more  ICDM 2007»
16 years 1 months ago
Solving Consensus and Semi-supervised Clustering Problems Using Nonnegative Matrix Factorization
Consensus clustering and semi-supervised clustering are important extensions of the standard clustering paradigm. Consensus clustering (also known as aggregation of clustering) ca...
Tao Li, Chris H. Q. Ding, Michael I. Jordan
CPE
1998
Springer
80views Hardware» more  CPE 1998»
15 years 11 months ago
Probability, Parallelism and the State Space Exploration Problem
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
William J. Knottenbelt, Mark Mestern, Peter G. Har...
EUROGP
1998
Springer
15 years 11 months ago
Immediate Transfer of Global Improvements to All Individuals in a Population Compared to Automatically Defined Functions for the
Koza has shown how automatically defined functions (ADFs) can reduce computational effort in the GP paradigm. In Koza's ADF, as well as in standard GP, an improvement in a par...
Ricardo Aler