2612 search results - page 203 / 523 » Switching Graphs and Their Complexity |
139
click to vote
GG
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Development processes in engineering disciplines are inherently complex. Throughout the development process, different kinds of inter-dependent design documents are creat...
132
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
143
click to vote
DATE
1997
IEEE
15 years 8 months ago
1997
IEEE
In this paper a new approach is presented to build a list of faults to be used by the fault injection environment; the list is built starting from a high-level description of the ...
137
Voted
ICWS
2007
IEEE
15 years 6 months ago
2007
IEEE
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
120
click to vote
ISCAPDCS
2007
15 years 6 months ago
2007
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...