Sciweavers

4865 search results - page 865 / 973
» The Complexity of Graph Connectivity
Sort
View
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
15 years 3 months ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
SAC
2005
ACM
15 years 3 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
SIGECOM
2005
ACM
93views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
Ranking systems: the PageRank axioms
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
Alon Altman, Moshe Tennenholtz
AOSE
2005
Springer
15 years 3 months ago
Improving AOSE with an Enriched Modelling Framework
Many approaches and tools assist the various tasks required to develop a multi-agent system (MAS), yet there still remains a gap between the generation of MAS models and program co...
Richard Hill, Simon Polovina, Martin D. Beer
FPGA
2005
ACM
80views FPGA» more  FPGA 2005»
15 years 3 months ago
Simultaneous timing-driven placement and duplication
Logic duplication is an effective method for improving circuit performance. In this paper we present an algorithm named SPD that performs simultaneous placement and duplication to...
Gang Chen, Jason Cong