Sciweavers

748 search results - page 68 / 150
» concurrency 2008
Sort
View
SIAMCOMP
1998
176views more  SIAMCOMP 1998»
15 years 8 days ago
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
Yonatan Aumann, Yuval Rabani
98
Voted
TCAD
2008
103views more  TCAD 2008»
15 years 15 days ago
Using Transfer-Resource Graph for Software-Based Verification of System-on-Chip
The verification of a system-on-chip is challenging due to its high level of integration. Multiple components in a system can behave concurrently and compete for resources. Hence, ...
Xiaoxi Xu, Cheng-Chew Lim
ENTCS
2008
120views more  ENTCS 2008»
15 years 20 days ago
Separation Logic Semantics for Communicating Processes
This paper explores a unification of the ideas of Concurrent Separation Logic with those of Communicating Sequential Processes. It extends separation logic by an operator for sepa...
Tony Hoare, Peter W. O'Hearn
WCNC
2008
IEEE
15 years 7 months ago
On Spatial Reuse and Capture in Ad Hoc Networks
—Neighbors of both the transmitter and the receiver must keep quiet in a 802.11 wireless network as it requires bidirectional exchange, i.e., nodes reverse their roles as transmi...
Naveen Santhapuri, Srihari Nelakuditi, Romit Roy C...
CONCURRENCY
2006
169views more  CONCURRENCY 2006»
15 years 19 days ago
A component-based middleware framework for configurable and reconfigurable Grid computing
Significant progress has been made in the design and development of Grid middleware which, in its present form, is founded on service-oriented architecture and web services techno...
Geoff Coulson, Paul Grace, Gordon S. Blair, Wei Ca...