Sciweavers

598 search results - page 72 / 120
» The Puzzle Layout Problem
Sort
View
VLSID
2007
IEEE
206views VLSI» more  VLSID 2007»
14 years 8 months ago
MAX: A Multi Objective Memory Architecture eXploration Framework for Embedded Systems-on-Chip
Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and l...
T. S. Rajesh Kumar, C. P. Ravikumar, R. Govindaraj...
WEA
2007
Springer
112views Algorithms» more  WEA 2007»
14 years 1 months ago
Crossing Minimization in Weighted Bipartite Graphs
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
Olca A. Çakiroglu, Cesim Erten, Ömer K...
AAAI
2000
13 years 9 months ago
Human-Guided Simple Search
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
David Anderson, Emily Anderson, Neal Lesh, Joe Mar...
VLSID
2004
IEEE
73views VLSI» more  VLSID 2004»
14 years 8 months ago
Wire Swizzling to Reduce Delay Uncertainty Due to Capacitive Coupling
Reduction of worst-case delay and delay uncertainty due to capacitive coupling is a still unsolved problem in physical design. We describe a routing only layout solution - swizzli...
Puneet Gupta, Andrew B. Kahng
CHI
2003
ACM
14 years 8 months ago
Personal media exploration with semantic regions
Computer users deal with large amount of personal media data and they often face problems in managing and exploring them. The paper presents an innovative approach, Semantic Regio...
Hyunmo Kang