Sciweavers

2124 search results - page 247 / 425
» Aggregating time partitions
Sort
View
ISAAC
2005
Springer
86views Algorithms» more  ISAAC 2005»
16 years 2 days ago
On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
Chris Worman, Boting Yang
ASPDAC
2004
ACM
97views Hardware» more  ASPDAC 2004»
16 years 4 hour ago
Interconnect design methods for memory design
- This paper presents a solution to the problem of designing interconnects for memory devices. More precisely, it solves the automatic routing problem of memory peripheral circuits...
Chanseok Hwang, Massoud Pedram
EVOW
2004
Springer
15 years 12 months ago
Top-Down Evolutionary Image Segmentation Using a Hierarchical Social Metaheuristic
Abstract. This paper presents an application of a hierarchical social (HS) metaheuristic to region-based segmentation. The original image is modelled as a simplified image graph, w...
Abraham Duarte, Ángel Sánchez, Felip...
ASAP
2002
IEEE
85views Hardware» more  ASAP 2002»
15 years 11 months ago
Predictable Instruction Caching for Media Processors
The determinism of instruction cache performance can be considered a major problem in multi-media devices which hope to maximise their quality of service. If instructions are evic...
James Irwin, David May, Henk L. Muller, Dan Page
DATE
2002
IEEE
102views Hardware» more  DATE 2002»
15 years 11 months ago
Improving Placement under the Constant Delay Model
In this paper, we show that under the constant delay model the placement problem is equivalent to minimizing a weighted sum of wire lengths. The weights can be efficiently compute...
Kolja Sulimma, Wolfgang Kunz, Ingmar Neumann, Luka...