Sciweavers

7167 search results - page 1177 / 1434
» Answer Set Programming
Sort
View
111
Voted
VTS
2007
IEEE
135views Hardware» more  VTS 2007»
15 years 8 months ago
High Level Synthesis of Degradable ASICs Using Virtual Binding
—As the complexity of the integrated circuits increases, they become more susceptible to manufacturing faults, decreasing the total process yield. Thus, it would be desirable to ...
Nima Honarmand, A. Shahabi, Hasan Sohofi, Maghsoud...
ATAL
2007
Springer
15 years 8 months ago
A Q-decomposition and bounded RTDP approach to resource allocation
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
CP
2007
Springer
15 years 8 months ago
Towards Robust CNF Encodings of Cardinality Constraints
Motivated by the performance improvements made to SAT solvers in recent years, a number of different encodings of constraints into SAT have been proposed. Concrete examples are th...
João P. Marques Silva, Inês Lynce
CP
2007
Springer
15 years 8 months ago
Limitations of Restricted Branching in Clause Learning
The techniques for making decisions, i.e., branching, play a central role in complete methods for solving structured CSP instances. In practice, there are cases when SAT solvers be...
Matti Järvisalo, Tommi A. Junttila
CP
2007
Springer
15 years 8 months ago
A Case for Simple SAT Solvers
As SAT becomes more popular due to its ability to handle large real-world problems, progress in efficiency appears to have slowed down over the past few years. On the other hand, w...
Jinbo Huang
« Prev « First page 1177 / 1434 Last » Next »