Results 171 to 180 of about 67,481 (208)
Combining greedy and evolutionary algorithms to maximize influence in networks under deterministic linear threshold model. [PDF]
PLoS OneAndreev A, Kochemazov S, Semenov A.
europepmc +1 more source
Temporal Extrapolation Generalization of Proper Orthogonal Decomposition (POD) and Radial Basis Function (RBF) Surrogates for Transient Thermal Fields in Multi-Heat-Source Electronic Devices. [PDF]
Micromachines (Basel)Zhao W, Zhang B.
europepmc +1 more source
Circuit implementation and analysis of a quantum-walk based search complement algorithm. [PDF]
Sci RepWing-Bocanegra A +2 more
europepmc +1 more source
An optimization scheduling model of multi-energy virtual power plants considering uncertainty constraints and multi-energy coupling characteristics. [PDF]
PLoS OneLu J, Wang J, Liu J, Liu Y.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Networks, 2002
AbstractIn this paper, we show how to give an orientation to the edges of an hypercube so that the inducedorientedhypercube offers approximately the same communication performance as that of the original nonoriented hypercube (routing, broadcasting, connectivity, etc.), that is, we show that it is possible to construct anN‐node oriented hypercube with ...
Fraigniaud, Pierre +2 more
openaire +3 more sources
AbstractIn this paper, we show how to give an orientation to the edges of an hypercube so that the inducedorientedhypercube offers approximately the same communication performance as that of the original nonoriented hypercube (routing, broadcasting, connectivity, etc.), that is, we show that it is possible to construct anN‐node oriented hypercube with ...
Fraigniaud, Pierre +2 more
openaire +3 more sources
SIAM Journal on Computing, 1998
Summary: This paper provides an analysis of a natural \(d\)-round tournament over \(n = 2^{d}\) players and demonstrates that the tournament possesses a surprisingly strong ranking property. The ranking property of this tournament is used to design efficient sorting algorithms for several models of parallel computation: (i) a comparator network of ...
Leighton, Tom, Plaxton, C. Greg
openaire +2 more sources
Summary: This paper provides an analysis of a natural \(d\)-round tournament over \(n = 2^{d}\) players and demonstrates that the tournament possesses a surprisingly strong ranking property. The ranking property of this tournament is used to design efficient sorting algorithms for several models of parallel computation: (i) a comparator network of ...
Leighton, Tom, Plaxton, C. Greg
openaire +2 more sources
Graphs and Combinatorics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Traffic analysis of hypercubes and banyan-hypercubes
[Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation, 2003The routing performance of banyan-hypercubes (BHs) is studied and compared with that of hypercubes. To evaluate the routing capabilities of BHs and hypercubes, a communication model is assumed. Based on this model, the traffic intensity of both networks is computed and the saturation probability of each network is determined.
A. Bellaachia, A. Youssef
openaire +1 more source