2916 search results - page 20 / 584 » Generating Rule Sets from Model Trees |
ICSE
2009
IEEE-ACM
15 years 4 months ago
2009
IEEE-ACM
It is labor-intensive to manually verify the outputs of a large set of tests that are not equipped with test oracles. Test selection helps to reduce this cost by selecting a small...
103
click to vote
GRC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract--Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns ...
110
click to vote
CIAC
1994
Springer
15 years 2 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
107
click to vote
DEXA
2004
Springer
15 years 3 months ago
2004
Springer
: In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently and effectively. In XAR-Miner, raw XML data are first transformed to either...
102
click to vote
AUTOMATICA
2007
14 years 10 months ago
2007
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...