Sciweavers

1960 search results - page 130 / 392
» The Logic of Large Enough
Sort
View
ICC
2000
IEEE
137views Communications» more  ICC 2000»
14 years 1 months ago
Stability of Maximal Size Matching Scheduling in Input-Queued Cell Switches
— We consider cell-based switch architectures in which the speedup of the internal switching fabric is not large enough to avoid input buffering. These architectures require a sc...
Emilio Leonardi, Marco Mellia, Marco Ajmone Marsan...
ICRA
2000
IEEE
122views Robotics» more  ICRA 2000»
14 years 1 months ago
Application of a Model-Free Algorithm for the Packing of Irregular Shaped Objects in Semiconductor Manufacture
A Robotic System is being developed to automate the crucible packing process in the CZ semiconductor wafer production. It requires the delicate manipulation and packing of highly ...
Vivek A. Sujan, Steven Dubowsky
DAC
2000
ACM
14 years 1 months ago
Predicting coupled noise in RC circuits by matching 1, 2, and 3 moments
This paper develops the noise-counterparts to familiar delay formulas like Elmore or PRIMO. By matching the first few moments of the network’s transfer impedance, we obtain effi...
Bernard N. Sheehan
DIAGRAMS
2000
Springer
14 years 1 months ago
On the Completeness and Expressiveness of Spider Diagram Systems
Spider diagram systems provide a visual language that extends the popular and intuitive Venn diagrams and Euler circles. Designed to complement object-oriented modelling notations ...
John Howse, Fernando Molina, John Taylor
INFOCOM
1998
IEEE
14 years 1 months ago
An End-to-End Reliable Multicast Protocol Using Polling for Scaleability
Reliable sender-based one-to-many protocols do not scale well due mainly to implosion caused by excessive rate of feedback packets arriving from receivers. We show that this probl...
Marinho P. Barcellos, Paul D. Ezhilchelvan