4342 search results - page 292 / 869 » Improved Algorithms for Optimal Embeddings |
179
click to vote
AIPS
2006
15 years 8 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
166
click to vote
ISPAN
1997
IEEE
15 years 11 months ago
1997
IEEE
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
176
Voted
DAC
1996
ACM
15 years 11 months ago
1996
ACM
In this paper, we study the problem of decomposing gates in fanin-unbounded or K-bounded networks such that the K-input LUT mapping solutions computed by a depthoptimal mapper hav...
161
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
Power grid networks in VLSI circuits are required to provide adequate input supply to ensure reliable performance. In this paper, we propose algorithms to find the placement of pow...
190
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
In programmable embedded systems, the memory subsystem represents a major cost, performance and power bottleneck. To optimize the system for such different goals, the designer wou...