9842 search results - page 253 / 1969 » The Complexity of the Matching-Cut Problem |
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
103
click to vote
ECML
2005
Springer
15 years 6 months ago
2005
Springer
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
CP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. In this paper we consider the problem of optimal task allocation and scheduling in embedded real-time systems. This problem is far from trivial due to the wide range of c...
115
Voted
ASWC
2009
Springer
15 years 3 months ago
2009
Springer
Many tasks within semantic web service discovery can be formalized as reasoning problems related to the partial ordering of subactivity occurrences in a complex activity. We show h...
128
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
This paper proposes a reweighted least squares algorithm for quadrature amplitude modulation (QAM) detector in multiple-input multiple-output (MIMO) channels. Although the QAM det...