584 search results - page 6 / 117 » Combinatorial optimization problems in wireless switch desig... |
EURODAC
1994
IEEE
15 years 3 months ago
1994
IEEE
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
DATE
2010
IEEE
15 years 4 months ago
2010
IEEE
—In this paper we study the effectiveness of two power gating methods – transistor switches and MEMS switches – in reducing the power consumption of a design with a certain t...
108
click to vote
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
IDEAL
2005
Springer
15 years 5 months ago
2005
Springer
Consider a network of unreliable links, each of which comes with a certain price and reliability. Given a fixed budget, which links should be bought in order to maximize the syste...