Sciweavers

62 search results - page 9 / 13
» Generalized cofactoring for logic function evaluation
Sort
View
ML
2011
ACM
308views Machine Learning» more  ML 2011»
13 years 1 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
14 years 1 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
SCCC
2005
IEEE
14 years 29 days ago
Optimizing repair programs for consistent query answering
Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...
Mónica Caniupán Marileo, Leopoldo E....
PEPM
2010
ACM
14 years 4 months ago
Making "stricterness" more relevant
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
Stefan Holdermans, Jurriaan Hage
DAC
2001
ACM
14 years 8 months ago
A True Single-Phase 8-bit Adiabatic Multiplier
This paper presents the design and evaluation of an 8-bit adiabatic multiplier. Both the multiplier core and its built-in self-test logic have been designed using a true single-ph...
Suhwan Kim, Conrad H. Ziesler, Marios C. Papaefthy...