4903 search results - page 5 / 981 » The Set Covering Machine |
MSS
2008
IEEE
14 years 9 months ago
2008
IEEE
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
83
Voted
EWCBR
2004
Springer
15 years 2 months ago
2004
Springer
Over the years, many successful applications of case-based reasoning (CBR) systems have been developed in different areas. The performance of CBR systems depends on several factor...
157
click to vote
MLQ
2011
14 years 4 months ago
2011
Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that cov...
69
Voted
DAC
1999
ACM
15 years 10 months ago
1999
ACM
Abstract { This paper presents the machine description language LISA for the generation of bitand cycle accurate models of DSP processors. Based on a behavioral operation descripti...
ACL
1998
14 years 11 months ago
1998
In this paper we present an ambiguity preserving translation approach which transfers ambiguous LFG f-structure representations. It is based on packed f-structure representations ...