690 search results - page 34 / 138 » Dense Admissible Sets |
COMPGEOM
2009
ACM
14 years 4 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
HYBRID
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. In this paper we investigate a new technique to determine whether an open continuous system behaves correctly for all admissible input signals. This technique is based on...
CAGD
2010
13 years 6 months ago
2010
Skinning of an ordered set of discrete circles is discussed in this paper. By skinning we mean the geometric construction of two G1 continuous curves touching each of the circles ...
CORR
2002
Springer
13 years 9 months ago
2002
Springer
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...