Sciweavers

8874 search results - page 202 / 1775
» A New Implementation of Automath
Sort
View
EUROSIM
1994
15 years 5 months ago
Pact: An Environment for Parallel Heuristic Programming
This paper introduces Pact, a new model for parallel heuristic programming on MIMD machines. Designed and implemented as an integrated tool environment, Pact allows the user to dev...
Marc Aguilar, Béat Hirsbrunner
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
15 years 5 months ago
Combining cartesian genetic programming with an estimation of distribution algorithm
This paper describes initial testing of a novel idea to combine a CGP with an EDA. In recent work a new improved crossover technique was successfully applied to a CGP. To implemen...
Janet Clegg
ICDE
2006
IEEE
161views Database» more  ICDE 2006»
16 years 5 months ago
A Primitive Operator for Similarity Joins in Data Cleaning
Data cleaning based on similarities involves identification of "close" tuples, where closeness is evaluated using a variety of similarity functions chosen to suit the do...
Surajit Chaudhuri, Venkatesh Ganti, Raghav Kaushik
VLSISP
2002
87views more  VLSISP 2002»
15 years 4 months ago
A 16-Bit by 16-Bit MAC Design Using Fast 5: 3 Compressor Cells
3:2 counters and 4:2 compressors have been widely used for multiplier implementations. In this paper, a fast 5:3 compressor is derived for high-speed multiplier implementations. Th...
Ohsang Kwon, Kevin J. Nowka, Earl E. Swartzlander ...
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 8 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...