6365 search results - page 322 / 1273 » Fast Local Computation Algorithms |
148
click to vote
IJCAI
1997
15 years 8 months ago
1997
We consider algorithms of the Waltz type for computing local consistency (also called arcconsistency) for constraints over numeric domains. Many commonlyused propagationrules do n...
151
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
Dynamic fault-tolerance management (DFTM) was previously introduced as a means of providing environmentand workload-driven adaptation for failure-prone battery powered systems. Th...
160
click to vote
FUIN
2007
15 years 6 months ago
2007
In the paper triangular graphs are discussed. The class of triangular graphs is of special interest as unifying basic features of complete graphs with trees and being used on many ...
182
click to vote
JAPLL
2010
15 years 5 months ago
2010
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
205
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....