Sciweavers

33356 search results - page 446 / 6672
» Models of Continual Computation
Sort
View
TON
2008
99views more  TON 2008»
15 years 6 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
SAFECOMP
2010
Springer
15 years 5 months ago
Computational Concerns in the Integration of Unmanned Airborne Systems into Controlled Airspace
Unmanned Airborne Systems (UAS) offer significant benefits for long duration missions. They can also be used in situations where it is inappropriate to expose aircrew to increased ...
Christopher W. Johnson
IPPS
2010
IEEE
15 years 4 months ago
A PRAM-NUMA model of computation for addressing low-TLP workloads
It is possible to implement the parallel random access machine (PRAM) on a chip multiprocessor (CMP) efficiently with an emulated shared memory (ESM) architecture to gain easy par...
Martti Forsell
ECAL
2005
Springer
16 years 11 days ago
Simulating Evolution with a Computational Model of Embryogeny: Obtaining Robustness from Evolved Individuals
Abstract. An evolutionary system is presented which employs an embryogeny model to evolve phenotypes in the form of layout of cells in specific patterns and shapes. It is shown th...
Chris P. Bowers
143
Voted
IPPS
2000
IEEE
15 years 11 months ago
Connectivity Models for Optoelectronic Computing Systems
Abstract. Rent's rule and related concepts of connectivity such as dimensionality, line-length distributions, and separators have found great use in fundamental studies of di ...
Haldun M. Özaktas