31 search results - page 5 / 7 » Faster SAT solving with better CNF generation |
CP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
ICANN
2009
Springer
13 years 11 months ago
2009
Springer
Backpropagation of errors is not only hard to justify from biological perspective but also it fails to solve problems requiring complex logic. A simpler algorithm based on generati...
KBSE
2007
IEEE
13 years 11 months ago
2007
IEEE
Monitoring the satisfaction of software requirements and diagnosing what went wrong in case of failure is a hard problem that has received little attention in the Software and Req...
GD
2005
Springer
13 years 10 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
CONSTRAINTS
2007
13 years 5 months ago
2007
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...