Sciweavers

11381 search results - page 164 / 2277
» Connectivity
Sort
View
118
Voted
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
15 years 8 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo
WETICE
1999
IEEE
15 years 8 months ago
Replacing Copies with Connections: Managing Software across the Virtual Organization
The Internet, the World Wide Web, JavaTM technology, and software components are changing the software business. Activities traditionally constrained by the need for intense infor...
Tobias Murer, Michael L. Van de Vanter
SIGGRAPH
1998
ACM
15 years 8 months ago
Real Time Compression of Triangle Mesh Connectivity
In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough...
Stefan Gumhold, Wolfgang Straßer
145
Voted
INFOCOM
1996
IEEE
15 years 8 months ago
Integrated Control of Connection Admission, Flow Rate, and Bandwidth for ATM Based Networks
: We consider the combined control problem of connection admission, flow rate, and bandwidth allocation (capacity, service-rate) under nonstationary conditions. A fluid flow model ...
Andreas Pitsillides, Petros A. Ioannou, David Tipp...
120
Voted
COCO
1990
Springer
106views Algorithms» more  COCO 1990»
15 years 8 months ago
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection
We show that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH3(k), where BH3(k) is the kth level of the Boolean hierarchy over P 2 . Th...
Richard Chang, Jim Kadin