Sciweavers

2926 search results - page 22 / 586
» Partially Optimal Routing
Sort
View
DGCI
2009
Springer
15 years 9 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso
ICCAD
2006
IEEE
304views Hardware» more  ICCAD 2006»
16 years 2 months ago
Trunk decomposition based global routing optimization
We present global routing optimization methods which are not based on rip-up and re-route framework. In particular, the routing optimization is based on trunk decomposition [13] o...
Devang Jariwala, John Lillis
ICON
2007
IEEE
16 years 6 days ago
Potential Impacts of Four-Byte AS Numbers in Partial Deployment
—Inter-domain routing is suffering from the lack of identifiers for the rapidly growing number of Autonomous Systems (AS), and therefore the 4-byte AS number has been proposed a...
Yuncheng Zhu, Junxiu Lu, Maoke Chen
ICCD
2006
IEEE
117views Hardware» more  ICCD 2006»
16 years 2 months ago
Fast, Performance-Optimized Partial Match Address Compression for Low-Latency On-Chip Address Buses
— The influence of interconnects on processor performance and cost is becoming increasingly pronounced with technology scaling. In this paper, we present a fast compression sche...
Jiangjiang Liu, Krishnan Sundaresan, Nihar R. Maha...
KI
2008
Springer
15 years 5 months ago
Partial Symbolic Pattern Databases for Optimal Sequential Planning
Abstract. This paper investigates symbolic heuristic search with BDDs for solving domain-independent action planning problems cost-optimally. By distributimpact of operators that t...
Stefan Edelkamp, Peter Kissmann