1361 search results - page 185 / 273 » Spaces of practice |
CHARME
2005
Springer
15 years 5 months ago
2005
Springer
Today, verification is becoming the dominating factor for successful circuit designs. In this context formal verification techniques allow to prove the correctness of a circuit ...
CP
2005
Springer
15 years 5 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
106
click to vote
DEXA
2005
Springer
15 years 5 months ago
2005
Springer
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
Recurrent neural networks are theoretically capable of learning complex temporal sequences, but training them through gradient-descent is too slow and unstable for practical use i...
102
click to vote
IFIP
2005
Springer
15 years 5 months ago
2005
Springer
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...