332 search results - page 34 / 67 » Hypercubic Sorting Networks |
EELC
2006
13 years 11 months ago
2006
We present a neural-competitive learning model of language evolution in which several symbol sequences compete to signify a given propositional meaning. Both symbol sequences and p...
ICDCS
1991
IEEE
13 years 11 months ago
1991
IEEE
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
In this paper, we analyze the fault tolerance of several bounded-degree networks that are commonly used for parallel computation. Among other things, we show that an N-node butterf...
ICNP
1999
IEEE
14 years 4 hour ago
1999
IEEE
This paper introduces a scalable maxmin flow control protocol which guarantees the minimum rate for each connection-oriented flow without requiring per-flow information. The proto...
IFIP
2003
Springer
14 years 27 days ago
2003
Springer
Whilst much effort has been put into the creation of routing algorithms to handle all sorts of mobility scenarios in ad-hoc networks, other fundamental issues, such as the addresse...