5105 search results - page 138 / 1021 » Approximate Structural Consistency |
128
Voted
JACM
1998
15 years 3 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
123
Voted
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popu...
128
click to vote
AUSAI
2005
Springer
15 years 9 months ago
2005
Springer
: In order to scale to problems with large or continuous state-spaces, reinforcement learning algorithms need to be combined with function approximation techniques. The majority of...
125
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
131
Voted
FUIN
2002
15 years 3 months ago
2002
Abstract. This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an ag...