663 search results - page 56 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
VTC
2008
IEEE
14 years 2 months ago
2008
IEEE
—This paper addresses the problem of joint linear transceiver design in the downlink of multiuser MIMO systems. We define the performance criterion as minimizing the maximal mea...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper addresses the problem of representing the set of repairs of a possibly inconsistent database by means of a disjunctive database. Specifically, the class of denial constr...
CONSTRAINTS
2007
13 years 7 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
QOSIP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The topological design of distributed packet switched networks consists of finding a topology that minimizes the communication costs by taking into account a certain num...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...