16404 search results - page 187 / 3281 » A set coverage problem |
150
Voted
CONSTRAINTS
2008
15 years 3 months ago
2008
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
138
Voted
CCCG
2008
15 years 5 months ago
2008
A set of points in the plane is said to be in general position if no three of them are collinear and no four of them are cocircular. If a point set determines only distinct vector...
115
click to vote
IJCAI
2003
15 years 4 months ago
2003
We address the task of problem determination in a distributed system using probes, or test transactions, which gather information about system components. Effective probing requir...
149
click to vote
STACS
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
144
Voted
AUTOMATICA
2007
15 years 3 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...