1671 search results - page 229 / 335 » On the Covering Steiner Problem |
161
click to vote
CASES
2010
ACM
15 years 4 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...
154
click to vote
LPAR
2010
Springer
15 years 3 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...
157
click to vote
SIAMNUM
2011
15 years 28 days 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...
187
click to vote
JSAT
2010
15 years 24 days ago
2010
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
160
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
—In a data center network, for example, it is quite often to use controllers to manage resources in a centralized manner. Centralized control, however, imposes a scalability prob...