Sciweavers

332 search results - page 34 / 67
» Hypercubic Sorting Networks
Sort
View
EELC
2006
128views Languages» more  EELC 2006»
15 years 3 months ago
Evolving Distributed Representations for Language with Self-Organizing Maps
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...
Simon D. Levy, Simon Kirby
ICDCS
1991
IEEE
15 years 3 months ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste
FOCS
1992
IEEE
15 years 3 months ago
On the Fault Tolerance of Some Popular Bounded-Degree Networks
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...
Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. ...
ICNP
1999
IEEE
15 years 4 months ago
Minimum Rate Guarantee Without Per-Flow Information
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...
Yuseok Kim, Wei Kang Tsai, Mahadevan Iyer, Jordi R...
IFIP
2003
Springer
15 years 5 months ago
Self-Organising Node Address Management in Ad Hoc Networks
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...
Stephen Toner, Donal O'Mahony