Reconfigurable architectures: A new vision for optimization problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1330, Issue , 1997, Pages 209-221

  Hamadi, Y ^a   Merceron, D ^a  

^a LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; FIELD PROGRAMMABLE GATE ARRAYS (FPGA);

CONJUNCTIVE NORMAL FORMS; FPGA TECHNOLOGY; LOCAL SEARCH; LOGIC CHIPS; OPTIMIZATION PROBLEMS; REAL TIME; SAT PROBLEMS; SATISFIABILITY PROBLEMS;

RECONFIGURABLE ARCHITECTURES;

EID: 35248848900     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0017441     Document Type: Conference Paper

References (13)

1. P. R. Cooper and M. J. Swain. Arc consistency: parallelism and domain dependence. Artificial Intelligence, 58:207-235, 1992.
2. Luidgi Dadda. Some schemes for parallel multipliers, volume 19. Alta Frequenza, 1965.
3. James G. Eldredge and Brad L. Hutchings. Rrann: the run time reconfiguration artificial neural network. In Proc of Custom Integrated Circuits Conference, pages 77-80, 1994.
4. Y. Hamadi, C. Bessiere, and J. Quinqueton. Gsat distribution. In Proceedings of the Second International Conference on Multiagent Systems, page 437, 1996.
5. E. Lemoine and D. Merceron. Run time reconfiguration of FPGA for scanning genomic databases. In D. A. Buell and K. L. Pocek, editors, Proceedings of IEEE Workshop on FPGAs for Custom Computing Machines, pages 90-98, Napa, CA, April 1995.
6. S. Minton, M.D. Johnson, A.B. Philips, and P. Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction problems and scheduling problems. Artificial Intelligence, pages 161-205, 1992.
7. A. Newell. Unified theory of cognition. Harvard University Press, 1994.
8. M. Schafïner. Computers formed by the problems rather than problems deformed by the computer. COMCON Digest, pages 259-264, 1972.
9. B. Selman and H. Kautz. Domain-independant extensions to gsat: Solving large structured satisfiability problems. In International Joint Conference on Artificial Intelligence., pages 290-295, 1993.
10. B. Selman, H. Levesque, and D. Mitchell. Hard and easy distributions of sat problems. In Proceedings, Tenth National Conference, on Artificial Intelligence, San Jose, OĀ.
11. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings, Tenth National Conference on Artificial Intelligence, San Jose, CA, pages 440-446, 1992.
12. Xilinx Inc. The Programmable Gate Array Data Book. Product Briefs, xilinx san jose edition, 1991.
13. M. Yokoo, T. Suyama, and H. Sawada. Solving satisfiability problems using field programmable gate arrays: First results. In Second International Conference on Principles and Practice of Constraint Programming, pages 497-509, 1996.