5210 search results - page 267 / 1042 » Computing Capabilities of Mediators |
185
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
164
Voted
ICDCSW
2002
IEEE
15 years 11 months ago
2002
IEEE
The coordination paradigm has been used extensively as a mechanism for software composition and integration. However, relatively little work has been done for the cases where the ...
143
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Circuit-switched Banyan interconnection networks can be built from simple switching elements that do not have logical processing or buffering capabilities. This paper describes a ...
181
click to vote
CHI
1994
ACM
15 years 10 months ago
1994
ACM
Treemaps support visualization of large hierarchical information spaces. The treemap generation algorithm is straightforward and application prototypes have only minimal hardware ...
161
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
This tutorial introduces several methods of formal hardware veri cation that could potentially have a practical impact on the design process. The measure of success in integrating...