نتایج جستجو برای: network logic

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

2006
Svetlana N. Yanushkevich Bernd Steinbach Vlad P. Shmerko

This paper addresses the interconnect problem of representation of logic networks in spatial dimensions. Interest to spatial interconnect is motivated by the advent in nanotechnologies and attempts to evaluate and explore the appropriate nanoscale architectures. It have been shown in our previous study that 3D logic network with target topology can be designed by replacing each elementary logic...

Journal: :Integration 2014
Igor Lemberski Petr Fiser

A synthesis flow oriented on producing the delay-insensitive dual-rail asynchronous logic is proposed. Within this flow, the existing synchronous logic synthesis tools are exploited to design technology independent single-rail synchronous Boolean network of complex (AND-OR) nodes. Next, the transformation into a dual-rail Boolean network is done. Each node is minimized under the formulated cons...

2006
Keum-Sung Hwang Sung-Bae Cho

The vision-based scene understanding technique that infers scene-interpreting contexts from real-world vision data has to not only deal with various uncertain environments but also reflect user’s requests. Especially, learnability is a hot issue for the system. In this paper, we adopt a probabilistic approach to overcome the uncertainty, and propose an interactive learning method using combinat...

Journal: :CoRR 2016
Carlos Leandro

This work describes a methodology to combine logic-based systems and connectionist systems. Our approach uses finite truth valued Lukasiewicz logic, where we take advantage of fact, presented by Castro in [6], what in this type of logics every connective can be define by a neuron in an artificial network having by activation function the identity truncated to zero and one. This allowed the inje...

1998
Steffen Hölldobler Yvonne Kalinke Hans-Peter Störr

In this paper we show that a feedforward neural network with at leastone hiddenlayer can approximate the meaning function TP for an acceptable logic program P . This is found by using the property of acceptable logic programs that for this class of programs the meaning function TP is a contraction mapping on the complete metric space of the interpretations for P as shown by Fitting in [3]. Usin...

2000
Hamish Fallside Michael John Sebastian Smith

In this paper we explore the design of internet-based systems using field-programmable logic (FPL). We describe results from designing a hardware platform that connects FPL directly to an internet. This hardware platform comprises an FPGA; an Ethernet interface; storage for static and dynamic configuration; and nonvolatile configuration logic. An important feature of our hardware platform desig...

2015
Dong-Keun Jeon Yeonwoo Lee

This paper reviews applications of fuzzy logic to ECMA-368 based WiMedia UWB networks and proposes a fuzzy logic control scheme for dynamic channel allocation with combined prioritized contention access (PCA) and distributed reservation protocol (DRP). Such WiMedia UWB network is applicable to a wireless ship area pico-network for supporting both high-quality multimedia services on shipboard an...

1996
S. Bommu M. Ciesielski N. O'Neill P. Kalla

This paper introduces a new logic transformation that integrates retiming with algebraic and Boolean transformations at the technology-independent level. It ooers an additional degree of freedom in sequential network optimization resulting from implicit retiming across logic blocks and fanout stems. The application of this transformation to sequential network synthesis results in the optimizati...

2015
Saratha Sathasivam

This paper presents an improved technique for accelerating the process of doing logic programming in discrete Hopfield neural network by integrating fuzzy logic and modifying activation function. Generally Hopfield networks are suitable for solving combinatorial optimization problems and pattern recognition problems. However Hopfield neural networks also face some limitations; one of the major ...

2005
Yi-Dong Shen Qiang Yang

Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never stop. On the other hand, they generate cyclic influences, which are disallowed in Bayesian networks. Therefore, in existing PLP approaches logic programs with recursive loops are considered to be problematic and thus a...

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

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