Hillis, W. D. (1985). The Connection Machine. MIT Press, Cambridge, Ma. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Genetic Algorithms And Very Fast Simulated Reannealing: A.. - Ingber, Rosen (1992) (52 citations) (Correct)
....VFSR has no corresponding attribute and because the GA runs were simulated sequentially. However, a generation performance plot would be a more accurate estimate of the power of the genetic algorithms, especially if the GA simulations were run on parallel hardware such as the Connection Machine [20]. Then all function evaluations (performed in one generation) could be evaluated in parallel. It should be noted that parallel processing of GA can lead to spurious correlations and premature convergence [21] It should be noted in this context that VFSR also lends itself well to parallelization. ....
W.D. Hillis, The Connection Machine, The MIT Press, Cambridge, MA, (1985).
Ant Algorithms for Discrete Optimization - Dorigo, Di Caro, Gambardella (1998) (64 citations) (Correct)
.... in other population based algorithms can be easily adapted to the ACO structure (e.g. migration and di usion models adopted in the eld of parallel genetic algorithms, see for example reviews in [16, 38] Early experiments with parallel versions of AS for the TSP on the Connection Machine CM 2 [63] adopted the approach of attributing a single processing unit to each ant [4] Experimental results showed that communication overhead can be a major problem with this approach on ne grained parallel machines, since ants end up spending most of their time communicating to other ants the modi ....
W. D. Hillis. The Connection Machine. MIT Press, 1982.
A Proof of the Reducibility of General Port Graph Grammars to.. - Stewart (2002) (Correct)
.... are an approach to graph rewriting that generalises some existing formalisms: Alan Bawden proposed a framework in 1986, initially by the name Connection graphs , as a programming language for distributed computation based on his experience with the massively parallel Connection Machine at MIT [Baw86,Hil85]. His PhD thesis develops the idea further (now calling them Linear graph grammars , influenced by the link with linear logic described below) and uses them as a key formalism in the design of a compiler, where the linear graph grammars serve as the basis both for an intermediate representation ....
W. D. Hillis. The Connection Machine. MIT Press, Cambridge MA, 1985.
Vision-Based Road Detection in Automotive Systems: A.. - Broggi, Bertè (1995) (1 citation) (Correct)
No context found.
Hillis, W. D. (1985). The Connection Machine. MIT Press, Cambridge, Ma.
Performance Evaluation and Optimization - In Low-Cost Cellular (Correct)
No context found.
W. D. Hillis. The Connection Machine. MIT Press, Cambridge, Ma., 1985.
Speeding-up Mathematical Morphology Computations - With Special-Purpose Array (Correct)
No context found.
W. D. Hillis. The Connection Machine. MIT Press, Cambridge, Ma., 1985.
Compiling and Optimizing Dynamic Parallel Programs - Mark Chu-Carroll Carroll (Correct)
No context found.
W. Daniel Hillis. The Connection Machine. MIT Press, 1985.
Near-Optimal Hot-Potato Routing on Trees - Busch, Magdon-Ismail.. (2004) (Correct)
No context found.
W. D. Hillis. The Connection Machine. MIT press, 1985.
Efficient Bufferless Routing on Leveled Networks - Busch, Kelkar, Magdon-Ismail (2004) (Correct)
No context found.
W. D. Hillis. The Connection Machine. MIT press, 1985.
Efficient Bufferless Routing on Leveled Networks - Busch, Kelkar, Magdon-Ismail (2004) (Correct)
No context found.
W. D. Hillis. The Connection Machine. MIT press, 1985.
Layout of the Cube-Connected Cycles Without Long Wires - Chen, Lau (2001) (Correct)
No context found.
Hillis, W. D. (1985) The Connection Machine. MIT Press, Cambridge, MA.
Three-Dimensional Monte Carlo Device Simulation for.. - Architectures Henry.. (Correct)
No context found.
D. Hillis. The Connection Machine. MIT Press, Cambridge, MA, 1985.
Hard-Potato Routing - Busch, Herlihy, Wattenhofer (2000) (3 citations) (Correct)
No context found.
W. D. Hillis. The Connection Machine. MIT press, 1985.
Information Theory of Complex Networks: on evolution and.. - Sole, Valverde (Correct)
No context found.
Hillis, W. D. The Connection Machine, MIT Press (Cambridge, MA, 1985).
Better Adaptive Diagnosis of Hypercubes - Evangelos Kranakis Andrzej (1 citation) (Correct)
No context found.
W. D. Hillis, The Connection Machine, Cambridge, The MIT Press, 1985.
Physica A 289 (2001) 595--605 - Www Elsevier Com (Correct)
No context found.
W.D. Hillis, The Connection Machine, MIT Press, Cambridge, MA, 1985.
Dynamically Reconfigurable Architecture for a Class of Real-Time.. - Ohkami (1992) (Correct)
No context found.
W. D. Hillis, The Connection Machine, The MIT Press, 1985.
Data Parallel Switch-Level Simulation - Bryant (1988) (2 citations) (Correct)
No context found.
W. D. Hillis, The Connection Machine, MIT Press, 1985.
Implementation of Convex Hull algorithm for - Associative Real Time (Correct)
No context found.
W.D. Hillis, "The Connection Machine", MIT Press, 1985.
A Revival of Turing's Forgotten Connectionist Ideas.. - Teuscher, Sanchez (2000) (Correct)
No context found.
D. W. Hillis. The Connection Machine. The MIT Press, Cambridge, MA, London, England, 1985.
Greedy Õ(C+D) Hot-Potato Routing on Trees - Busch, Magdon-Ismail.. (2003) (Correct)
No context found.
W. D. Hillis. The Connection Machine. MIT press, 1985.
Unresponsiveness-Tolerant Collective Communication - Pakin (2001) (Correct)
No context found.
Danny Hillis. The Connection Machine. MIT Press, Cambridge, Massachusetts, 1985.
Greedy Õ(C+D) Hot-Potato Routing on Trees - Busch, Magdon-Ismail.. (2003) (Correct)
No context found.
W. D. Hillis. The Connection Machine. MIT press, 1985.
Generic Mesoscopic Neural Networks Based on Statistical Mechanics .. - Ingber (1992) (2 citations) (Correct)
No context found.
W.D. Hillis, The Connection Machine (The MIT Press, Cambridge, MA, 1985).
Aspects Theoriques Et Pratiques De L'inferences De Type Et Effets - Talpin (1993) (Correct)
No context found.
Hillis, W. D. The Connection Machine. The MIT Press, Cambridge, 1985.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC