Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Runtime property checking (as implemented in tools like Purify or Valgrind) checks whether a program execution satisfies a property. Active property checking extends runtime check...
Patrice Godefroid, Michael Y. Levin, David A. Moln...
Small-world experiments in which packages reach addressees unknown to the original sender through a forwarding chain confirm that acquaintance networks have short paths, a propert...
Supermarkets lose millions of pounds every year through lost trading and stock wastage caused by the failure of refrigerated cabinets. Therefore, a huge commercial market exists fo...
Background: Structure identification of dynamic models for complex biological systems is the cornerstone of their reverse engineering. Biochemical Systems Theory (BST) offers a pa...
Marco Vilela, Carlos Cristiano H. Borges, Susana V...