Sciweavers

1346 search results - page 176 / 270
» On the number of rectangular partitions
Sort
View
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
15 years 2 months ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
ISCA
1994
IEEE
104views Hardware» more  ISCA 1994»
15 years 2 months ago
Exploring the Design Space for a Shared-Cache Multiprocessor
In the near future, semiconductor technology will allow the integration of multiple processors on a chip or multichipmodule (MCM). In this paper we investigate the architecture an...
Basem A. Nayfeh, Kunle Olukotun
ASPDAC
2007
ACM
136views Hardware» more  ASPDAC 2007»
15 years 1 months ago
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
Pei-Ci Wu, Jhih-Rong Gao, Ting-Chi Wang
GLVLSI
2009
IEEE
172views VLSI» more  GLVLSI 2009»
15 years 1 months ago
Contact merging algorithm for efficient substrate noise analysis in large scale circuits
A methodology is proposed to efficiently estimate the substrate noise generated by large scale aggressor circuits. Small spatial voltage differences within the ground distribution...
Emre Salman, Renatas Jakushokas, Eby G. Friedman, ...
ATAL
2004
Springer
15 years 1 months ago
Generating Coalition Structures with Finite Bound from the Optimal Guarantees
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multiagent system...
Viet Dung Dang, Nicholas R. Jennings