Sciweavers

2593 search results - page 181 / 519
» On Two Problems of Nano-PLA Design
Sort
View
RECOMB
1997
Springer
15 years 3 months ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
TC
2008
14 years 10 months ago
Traffic-Balanced Routing Algorithm for Irregular Mesh-Based On-Chip Networks
On-chip networks (OCNs) have been proposed to solve the increasing scale and complexity of the designs in nanoscale multicore VLSI designs. The concept of irregular meshes is an im...
Shu-Yen Lin, Chun-Hsiang Huang, Chih-Hao Chao, Ken...
ASPDAC
2006
ACM
117views Hardware» more  ASPDAC 2006»
15 years 4 months ago
Signal-path driven partition and placement for analog circuit
This paper advances a new methodology based on signal-path information to resolve the problem of device-level placement for analog layout. This methodology is mainly based on three...
Di Long, Xianlong Hong, Sheqin Dong
78
Voted
SIGECOM
2003
ACM
124views ECommerce» more  SIGECOM 2003»
15 years 4 months ago
Coalitional games on graphs: core structure, substitutes and frugality
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
Rahul Garg, Vijay Kumar, Atri Rudra, Akshat Verma
DAC
2000
ACM
15 years 3 months ago
Watermarking while preserving the critical path
In many modern designs, timing is either a key optimization goal and/or a mandatory constraint. We propose the first intellectual property protection technique using watermarking ...
Seapahn Meguerdichian, Miodrag Potkonjak