2584 search results - page 150 / 517 » On the Forward Checking Algorithm |
ESOP
2009
Springer
14 years 3 months ago
2009
Springer
The operational semantics of interactive systems is usually d by labeled transition systems. Abstract semantics is defined in terms of bisimilarity that, in the finite case, can ...
MOC
1998
13 years 7 months ago
1998
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
CPAIOR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
DSD
2008
IEEE
13 years 10 months ago
2008
IEEE
The aim of this work is to present a method for rounding quadratically converging algorithms that improves their performance. This method is able to reduce significantly the numbe...
EUROCAST
2009
Springer
13 years 6 months ago
2009
Springer
Abstract. Given a basis of a vector space V over a field K and a multiplication table which defines a bilinear map on V , we develop a computer program on Mathematica which checks ...