Sciweavers

598 search results - page 78 / 120
» The Puzzle Layout Problem
Sort
View
TVLSI
2002
94views more  TVLSI 2002»
13 years 7 months ago
A network flow approach to memory bandwidth utilization in embedded DSP core processors
This paper presents a network flow approach to solving the register binding and allocation problem for multiword memory access DSP processors. In recently announced DSP processors,...
Catherine H. Gebotys
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
14 years 3 days ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
AAAI
1998
13 years 9 months ago
An Expert System for Alarm System Planning
This paper discusses the design and implementation of ESSPL, an expert system which generates security plans for alarm systems (Figure 1). Security planning is the task of determi...
Akira Tsurushima, Kenji Urushima, Daigo Sakata, Hi...
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 8 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
ICCAD
2003
IEEE
154views Hardware» more  ICCAD 2003»
14 years 4 months ago
Length-Matching Routing for High-Speed Printed Circuit Boards
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...
Muhammet Mustafa Ozdal, Martin D. F. Wong