The optimal path cover problem is to find a minimum number of vertex disjoint paths which together cover all the vertices of the graph. Finding an optimal path cover for an arbitrary graph is known to be NP-complete [3]. However, polynornial-time algorithms exist for trees [4], cacti [4] and for interval graphs [9]. The solution presented in [2] For circular-arc graphs is known to be wrong. In ...

About the cover The cover illustrates the mouse's perspective inside the DualCage while approaching the test compartment (front) and returning to the home compartment (back).

We present a learning algorithm for decision lists which allows features that are constructed from the data and allows a trade-off between accuracy and complexity. We provide bounds on the generalization error of this learning algorithm in terms of the number of errors and the size of the classifier it finds on the training data. We also compare its performance on some natural data sets with th...

We introduce a new learning algorithm for decision lists to allow features that are constructed from the data and to allow a tradeoff between accuracy and complexity. We bound its generalization error in terms of the number of errors and the size of the classifier it finds on the training data. We also compare its performance on some natural data sets with the set covering machine and the suppo...

In the paper, authors present a greedy algorithm for construction of exact and partial tests (super-reducts) for decision tables with many-valued decisions. Exact tests can be over-fitted, so instead of them it is often more appropriate to work with partial tests with smaller number of attributes. Based on results for set cover problem authors study bounds on accuracy of greedy algorithm for ex...

In this investigation, the effects of enclosure, restal delayed grazing andcontinued grazing treatments on the production rate and vegetation cover were studied.Study area was SadrAbad pasture. After selecting three bands (1+1+1=3 hectare area) asthree treatments in the restricted and non restricted area, they were transected to threetransects. Then plots (1×2m2 ) were selected to measure the p...

Software tools that analyze and generate code from ORM conceptual schemas are highly susceptible to feature interaction bugs. When testing such tools, test suites are needed that cover many combinations of features, including combinations that rarely occur in practice. Manually creating such a test suite is extremely labor-intensive, and the tester may fail to cover feasible feature combination...