67 search results - page 11 / 14 » Empirical Evaluation of Four Tensor Decomposition Algorithms |
ISSTA
2010
ACM
13 years 9 months ago
2010
ACM
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
ISORC
1999
IEEE
13 years 11 months ago
1999
IEEE
To analyze the complexity of object-oriented software, several metrics have been proposed. Among them, Chidamber and Kemerer's metrics are well-known ones as object-oriented ...
ISSTA
2009
ACM
14 years 1 months ago
2009
ACM
Techniques for test-case prioritization re-order test cases to increase their rate of fault detection. When there is a fixed time budget that does not allow the execution of all ...
ICCBR
2009
Springer
14 years 2 months ago
2009
Springer
This work presents a new approach that allows the use of cases in a case base as heuristics to speed up Reinforcement Learning algorithms, combining Case Based Reasoning (CBR) and ...
APWEB
2010
Springer
14 years 7 days ago
2010
Springer
—Extensive research has been conducted on top of online social networks (OSNs), while little attention has been paid to the data collection process. Due to the large scale of OSN...