The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...
The ability for multiple threads to enter the same graph node without contention and conflict is a necessary component of the graph reduction of functional languages since graph c...
Abstract: P2P Meeting Tool is a meeting management tool, which uses Peer-toPeer technology to realise a pervasive computing environment. Users can search for and join a meeting ses...
One of the difficulties of using model checkers “in the large” is the management of all (generated) data during the validation trajectory. It is important that the results obta...
We introduce a new bias for rule learning systems. The bias only allows a rule learner to create a rule that predicts class membership if each test of the rule in isolation is pred...