2020 search results - page 63 / 404 » Speeding up Slicing |
CADE
2001
Springer
14 years 10 months ago
2001
Springer
This paper investigates optimization techniques and data structures exploiting the use of so-called pseudo models. These techniques are applied to speed up TBox and ABox reasoning ...
DCC
2008
IEEE
14 years 9 months ago
2008
IEEE
Abstract. A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are inves...
SAC
2009
ACM
14 years 4 months ago
2009
ACM
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
PARELEC
2006
IEEE
14 years 4 months ago
2006
IEEE
Modern microprocessors get more and more susceptible to transient faults, e.g. caused by high-energetic particles due to high integration, clock frequencies, temperature and decre...