88 search results - page 11 / 18 » Improved Bounds and Schemes for the Declustering Problem |
SARA
2009
Springer
14 years 2 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
ISQED
2007
IEEE
14 years 2 months ago
2007
IEEE
In nanometer regime, the effects of variations are having an increasing impact on the delay and power characteristics of devices as well as the yield of the circuit. Statistical t...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— It was shown by Cadambe and Jafar that the interference alignment (IA) algorithm achieves the theoretical bound on degrees of freedom (DOF) for interference channel systems. Ho...
ECRTS
1998
IEEE
14 years 2 days ago
1998
IEEE
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
STOC
1999
ACM
14 years 3 days ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...