نتایج جستجو برای: irregular lattice networks
تعداد نتایج: 548451 فیلتر نتایج به سال:
There is consensus in the current literature that stable states of asynchronous irregular spiking activity require (i) large networks of 10 000 or more neurons and (ii) external background activity or pacemaker neurons. Yet already in 1963, Griffith showed that networks of simple threshold elements can be persistently active at intermediate rates. Here, we extend Griffith’s work and demonstrate...
ÐCut-through switching promises low latency delivery and has been used in new generation switches, especially in high speed networks demanding low communication latency. The interconnection of cut-through switches provides an excellent network platform for high speed local area networks (LANs). For cost and performance reasons, irregular topologies should be supported in such a switch-based net...
In interconnection networks, there are several problems related to deadlock. We shall address deadlocks in the context of modularity, shortest path routing in irregular networks and fault tolerance. Deadlock freedom in interconnection networks is not a modular issue. One cannot generally combine two or more deadlock free interconnection network configurations without introducing new deadlock pr...
Deployment of sensors in any irregular terrain with 100% coverage and connectivity is a challenging issue in the field of Wireless Sensor Networks. Traditional deployments often assume homogeneous environments, which ignore the effect of terrain profile as well as the in-network obstacles situated randomly like buildings, trees, roads and so on. Proper deployment of sensors in such irregular re...
A quadtree-based triangulation, sometimes called an RTIN, is a common hierarchical representation of terrain for 3D visualization. In this paper we focus on the memory/error bound trade-offs for using RTINs with planar and quadratic surface patches over triangles.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید