Sciweavers

1529 search results - page 136 / 306
» A slant removal algorithm
Sort
View
GLVLSI
2007
IEEE
106views VLSI» more  GLVLSI 2007»
14 years 4 months ago
Floorplan repair using dynamic whitespace management
We describe an efficient, top-down strategy for overlap removal and floorplan repair which repairs overlaps in floorplans produced by placement algorithms or rough floorplanni...
Kristofer Vorwerk, Andrew A. Kennings, Doris T. Ch...
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
14 years 4 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
VTC
2006
IEEE
112views Communications» more  VTC 2006»
14 years 4 months ago
Adaptive Resource Allocation Based on Channel Information in Multihop OFDM Systems
— In this paper, we investigate the adaptive resource allocation problem in multiuser multihop OFDM systems. Assuming that base station(BS) knows all channel information, we form...
ChiSung Bae, Dong-Ho Cho
SPAA
2006
ACM
14 years 4 months ago
Towards automatic parallelization of tree reductions in dynamic programming
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
IICS
2003
Springer
14 years 3 months ago
Where to Start Browsing the Web?
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...
Dániel Fogaras