1405 search results - page 55 / 281 » Popularity at Minimum Cost |
FPL
1997
Springer
15 years 1 months ago
1997
Springer
Technology mapping can be viewed as the optimization problem of finding a minimum cost cover of the given Boolean network by choosing from given library of logic cells. The core of...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
105
click to vote
IJNM
2008
14 years 9 months ago
2008
Advance reservation of lightpaths in Grid environments is necessary to guarantee QoS and reliability. In this paper, we have evaluated and compared several algorithms for dynamic ...
ET
2002
14 years 9 months ago
2002
In this paper we explore two alternative approaches to system diagnosis. The first strategy is based on testability analysis performed by SATAN tool. The second approach performed ...
108
click to vote
CDC
2008
IEEE
14 years 10 months ago
2008
IEEE
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...