1300 search results - page 117 / 260 » Constraint satisfaction problems and global cardinality cons... |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
NOMS
2000
IEEE
15 years 2 months ago
2000
IEEE
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...
ICTAI
2007
IEEE
15 years 4 months ago
2007
IEEE
In this paper, we present a new hypergraph partitioning algorithm that jointly optimizes the number of hyperedge cuts and the number of shared vertices in nonlinear constrained op...
106
click to vote
ASPDAC
2010
ACM
14 years 8 months ago
2010
ACM
Abstract-- We present a global scheduling framework for synchronous data flow (SDF) streaming applications on MPSoCs, based on optimized computation and contention-free routing. Th...