Sciweavers

2834 search results - page 506 / 567
» Representing Trees with Constraints
Sort
View
97
Voted
DAC
2009
ACM
16 years 1 months ago
Handling complexities in modern large-scale mixed-size placement
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
Jackey Z. Yan, Natarajan Viswanathan, Chris Chu
DAC
2003
ACM
16 years 1 months ago
A scalable software-based self-test methodology for programmable processors
Software-based self-test (SBST) is an emerging approach to address the challenges of high-quality, at-speed test for complex programmable processors and systems-on chips (SoCs) th...
Li Chen, Srivaths Ravi, Anand Raghunathan, Sujit D...
KDD
2005
ACM
218views Data Mining» more  KDD 2005»
16 years 29 days ago
A maximum entropy web recommendation system: combining collaborative and content features
Web users display their preferences implicitly by navigating through a sequence of pages or by providing numeric ratings to some items. Web usage mining techniques are used to ext...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
MOBIHOC
2006
ACM
16 years 4 days ago
Balancing distance and lifetime in delay constrained ad hoc networks
This paper addresses the problem of optimizing the packet transmission schedule in an ad hoc network with end-toend delay constraints. The emphasis is to determine the proper rela...
Ben Liang, Min Dong
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
15 years 9 months ago
Algorithms for simultaneous consideration of multiple physical synthesis transforms for timing closure
We propose a post-placement physical synthesis algorithm that can apply multiple circuit synthesis and placement transforms on a placed circuit to improve the critical path delay ...
Huan Ren, Shantanu Dutt