✦ LIBER ✦

Solving satisfiability problems by using reconfigurable hardware

✍ Scribed by Takayuki Suyama; Makoto Yokoo; Hiroshi Sawada; Akira Nagoya

Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 965 KB
Volume: 86
Category: Article
ISSN: 8756-663X
DOI: 10.1002/ecjb.10134

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the satisfiability problem by us

Solving the satisfiability problem by using randomized approach

✍ L.C. Wu; C.Y. Tang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Solving graph theory problems using reco

Solving graph theory problems using reconfigurable pipelined optical buses

✍ Keqin Li; Yi Pan; Mounir Hamdi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 125 KB

We solve a number of important and interesting problems from graph theory on a linear array with a recon®gurable pipelined optical bus system. Our algorithms are based on fast matrix multiplication and extreme value ®nding algorithms, and are currently the fastest algorithms. We also distinguish the

GridSAT: a system for solving satisfiabi

GridSAT: a system for solving satisfiability problems using a computational grid

✍ Wahid Chrabakh; Rich Wolski 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 316 KB

Strategies for solving the Boolean satis

Strategies for solving the Boolean satisfiability problem using binary decision diagrams

✍ Priyank Kalla; Zhihong Zeng; Maciej J. Ciesielski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Statistical physics analysis of the comp

Statistical physics analysis of the computational complexity of solving random satisfiability problems using backtrack algorithms

✍ S. Cocco; R. Monasson 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 528 KB

Solving virtual topology reconfiguration

Solving virtual topology reconfiguration problem on survivable WDM networks by using simulated annealing and genetic algorithms

✍ Der-Rong Din 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 881 KB