1566 search results - page 207 / 314 » On a Cone Covering Problem |
125
click to vote
TSMC
2002
15 years 3 months ago
2002
Abstract--The notion of the necessary criticality (both with respect to path and to activity) of a network with imprecisely defined (by means of intervals or fuzzy intervals) activ...
106
click to vote
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract— We consider the problem of multi-robot coordination subject to constraints on the configuration. Specifically, we examine the case in which a mobile network of robots...
132
click to vote
CASES
2010
ACM
15 years 2 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
137
click to vote
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for temporal synthesis, l...
133
click to vote
SIAMNUM
2011
14 years 11 months ago
2011
In this paper we prove the discrete compactness property for a wide class of p finite element approximations of non-elliptic variational eigenvalue problems in two and three spac...