96 search results - page 6 / 20 » Convex and Network Flow Optimization for Structured Sparsity |
MASCOTS
2008
13 years 9 months ago
2008
Two classic categories of models exist for computer networks: network information flow and network of queues. The network information flow model appropriately captures the multi-ho...
CDC
2009
IEEE
13 years 5 months ago
2009
IEEE
In this paper, we investigate the cell design of bacteria during the exponential growth. To this purpose, we propose to formulate the problem as a non differentiable convex optimiz...
AINA
2005
IEEE
14 years 1 months ago
2005
IEEE
The network lifetime for wireless sensor network plays an important role to survivability. Thus, we indicate the importance of routing protocol to network lifetime, and model the ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...
DAC
1996
ACM
13 years 11 months ago
1996
ACM
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...