Sciweavers

13784 search results - page 2567 / 2757
» On Computing Functions with Uncertainty
Sort
View
SPAA
1996
ACM
14 years 1 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
SPAA
1996
ACM
14 years 1 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
ICCAD
1994
IEEE
151views Hardware» more  ICCAD 1994»
14 years 1 months ago
Multi-way VLSI circuit partitioning based on dual net representation
In this paper, we study the area-balanced multi-way partitioning problem of VLSI circuits based on a new dual netlist representation named the hybrid dual netlist (HDN), and propo...
Jason Cong, Wilburt Labio, Narayanan Shivakumar
TACS
1994
Springer
14 years 1 months ago
A Semantic Theory for Concurrent ML
In this paper we present a semantic theory for Concurrent ML. It consists of a new effect-based type system and a denotational model. The new type system is based on an extension o...
Dominique Bolignano, Mourad Debbabi
ICDCS
1990
IEEE
14 years 1 months ago
A Constructive Approach to the Design of Distributed Systems
The underlying model of distributed systems is that of loosely coupled components r running in parallel and communicating by message passing. Description, construction and evoluti...
Jeff Kramer, Jeff Magee, Anthony Finkelstein
« Prev « First page 2567 / 2757 Last » Next »