نتایج جستجو برای: computation capacity

تعداد نتایج: 419291  

2009
Michael Balzer

Voronoi tessellations specify a partition of a given space according to a set of sites where all points in that space are assigned to the closest site. Capacity-constrained Voronoi tessellations are special cases of Voronoi tessellations in which the region of each site has a predefined area. For example, the capacity constraint could state that each region in a Voronoi tessellation must have t...

2000
Simona Doboli Ali A. Minai

Attractor networks have been one of the most successful paradigms in neural computation and have been used as models of computation in the nervous system Many experimentally observed phenomena such as coherent population codes contextual representations and replay of learned neural activity patterns are explained well by attractor dynamics Recently we proposed a paradigm called latent attractor...

Journal: :International Journal for Research in Applied Science and Engineering Technology 2020

   Historically, DNA molecules have been known as the building blocks of life, later on in 1994, Leonard Adelman introduced a technique to utilize DNA molecules for a new kind of computation. According to the massive parallelism, huge storage capacity and the ability of using the DNA molecules inside the living tissue, this type of computation is applied in many application areas such as me...

Journal: :Comput. Sci. Inf. Syst. 2011
Bo Zhang Yang Xiang Peng Wang Zhenhua Huang

Cyber-physical system (CPS) provides more powerful service through combining software service and physical device. It is an effective solution to organize various CPS services to realize collaborative decision making (CDM). In CPS, finding out the most competent participators for CDM sponsor is a core problem. To solve this problem, we propose a novel capacity and trust computation based CPS se...

Journal: :CoRR 2013
Deekshith P. K. Vinod Sharma Ramachandran Rajesh

We consider an AWGN channel with a transmitter powered by an energy harvesting source. The node is equipped with a finite energy buffer. Such a system can be modelled as a channel with side information (about energy in the energy buffer) causally known at the transmitter. The receiver may or may not have the side information. We prove that Markov energy management policies are sufficient to ach...

Journal: :IEEE Trans. Pattern Anal. Mach. Intell. 1988
Sverrir Olafsson Yaser S. Abu-Mostafa

The investigation of information capacity and computation power of threshold elements is motivated by the recent trend of neural-network approaches to pattern recognition. In this correspondence, we estimate lower and upper bounds for the capacity of multilevel threshold elements, using two essentially different enumeration techniques. The results correct a previously published estimate and ind...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید