Sciweavers

1263 search results - page 42 / 253
» A* with Bounded Costs
Sort
View
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 4 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
INFOCOM
2006
IEEE
15 years 3 months ago
Designing Low Cost Networks with Short Routes and Low Congestion
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
Van Nguyen, Charles U. Martel
TALG
2008
152views more  TALG 2008»
14 years 9 months ago
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Retsef Levi, Dror Rawitz, Baruch Schiebe...
CONEXT
2010
ACM
14 years 7 months ago
LEGUP: using heterogeneity to reduce the cost of data center network upgrades
Fundamental limitations of traditional data center network architectures have led to the development of architectures that provide enormous bisection bandwidth for up to hundreds ...
Andrew R. Curtis, S. Keshav, Alejandro Lópe...
CASES
2010
ACM
14 years 7 months ago
Low cost multicast authentication via validity voting in time-triggered embedded control networks
Wired embedded networks must include multicast authentication to prevent masquerade attacks within the network. However, unique constraints for these networks make most existing m...
Christopher Szilagyi, Philip Koopman