Sciweavers

1727 search results - page 162 / 346
» A Technique for Large Automated Mechanism Design Problems
Sort
View
IDA
2003
Springer
15 years 11 months ago
A Logical Formalisation of the Fellegi-Holt Method of Data Cleaning
The Fellegi-Holt method automatically “corrects” data that fail some predefined requirements. Computer implementations of the method were used in many national statistics bure...
Agnes Boskovitz, Rajeev Goré, Markus Heglan...
FPGA
2006
ACM
224views FPGA» more  FPGA 2006»
15 years 10 months ago
Flexible implementation of genetic algorithms on FPGAs
In this paper, we propose a technique to flexibly implement genetic algorithms for various problems on FPGAs. For the purpose, we propose a basic architecture for GA which consist...
Tatsuhiro Tachibana, Yoshihiro Murata, Naoki Shiba...
FROCOS
2005
Springer
16 years 1 days ago
Proving Liveness with Fairness Using Rewriting
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
Adam Koprowski, Hans Zantema
NFM
2011
335views Formal Methods» more  NFM 2011»
15 years 1 months ago
CORAL: Solving Complex Constraints for Symbolic PathFinder
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
Matheus Souza, Mateus Borges, Marcelo d'Amorim, Co...
DAC
2006
ACM
16 years 7 months ago
Efficient SAT-based Boolean matching for FPGA technology mapping
Most FPGA technology mapping approaches either target Lookup Tables (LUTs) or relatively simple Programmable Logic Blocks (PLBs). Considering networks of PLBs during technology map...
Sean Safarpour, Andreas G. Veneris, Gregg Baeckler...