16404 search results - page 151 / 3281 » A set coverage problem |
130
Voted
JC
2000
15 years 3 months ago
2000
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
131
click to vote
FOCS
1996
IEEE
15 years 7 months ago
1996
IEEE
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space t...
111
click to vote
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
Given a finite set of points S in Rd , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number o...
125
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
101
click to vote
EUSFLAT
2003
15 years 4 months ago
2003
Remarks on history, theory, and applications of intuitionistic fuzzy sets are given. Some open problems are introduced.