16404 search results - page 833 / 3281 » A set coverage problem |
203
click to vote
IDA
2005
Springer
16 years 1 months ago
2005
Springer
Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned w...
162
click to vote
CIARP
2004
Springer
16 years 1 months ago
2004
Springer
In this paper we describe a heuristic approach to the problem of identifying a pattern embedded within a figure from a predefined set of patterns via the utilization of a genetic a...
255
click to vote
PKDD
2004
Springer
16 years 28 days ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
178
click to vote
DEXA
2003
Springer
16 years 25 days ago
2003
Springer
This paper presents an algorithm for termination static analysis of active rules with priorities. Active rules termination is an undecidable problem. Several recent works have sugg...
191
click to vote
TAP
2010
Springer
16 years 19 days ago
2010
Springer
Abstract. We consider the problem of test generation for Boolean combinational circuits. We use a novel approach based on the idea of treating tests as a proof encoding rather than...