«Forward algorithm»

۲۰٬۲۳۸ نتیجه
  • Backward-forward Algorithms for Structured Monotone Inclusions in Hilbert Spaces

    سند علمی۲۰۱۶HÉDY ATTOUCH, JUAN PEYPOUQUET, PATRICK REDONT

    In this paper, we study the backward-forward algorithm as a splitting method to solve structured monotone inclusions, and convex minimization problems in Hilbert spaces. It has a natural link with the forward-backward algorithm and has the same computational complexity, since it

  • A General Feed-Forward Algorithm for Gradient Descent in Connectionist Networks

    سند علمی۱۹۹۰Sebastian Thrun, Frank Smieja

    An extended feed-forward algorithm for recurrent connectionist networks is presented. This algorithm, which works locally in time, is derived both for discrete-in-time networks and for continuous networks. Several standard gradient descent algorithms for connectionist networks (e

  • An Adaptive Approach to Increase Accuracy of Forward Algorithm for Solving Evaluation Problems on Unstable Statistical Data Set

    مقاله۲۰۱۳Journal of Computer and RoboticsNader Rezazadeh, Omid SojodiShijani

    Nowadays, Hidden Markov models are extensively utilized for modeling stochastic processes. These models help researchers establish and implement the desired theoretical foundations using Markov algorithms such as Forward one. however, Using Stability hypothesis and the mean stati

  • an adaptive approach to increase accuracy of forward algorithm for solving evaluation problems on unstable statistical data set

    مقالهjournal of computer and roboticsomid sojodishijani, faculty of computer and information technology engineering, qazvin branch, islamic azad university, qazvin, iran nader rezazadeh, faculty of computer and information technology engineering, qazvin branch, islamic azad university, qazvin, iran

    nowadays, hidden markov models are extensively utilized for modeling stochastic processes. these models help researchers establish and implement the desired theoretical foundations using markov algorithms such as forward one. however, using stability hypothesis and the mean stati

  • An improved forward algorithm for optimal control of a class of hybrid systems

    سند علمی۲۰۰۲IEEE Trans. Automat. Contr.Ping Zhang, Christos G. Cassandras

    This note considers optimal control problems for a class of hybrid systems motivated by the structure of manufacturing environments that integrate process and operations control. We derive a new property of the optimal state trajectory structure which holds under a modified condi

  • Incremental Update of Datalog Materialisation: the Backward/Forward Algorithm

    سند علمی۲۰۱۵AAAIBoris Motik, Yavor Nenov, Robert Piro, Ian Horrocks

    Datalog-based systems often materialise all consequences of a datalog program and the data, allowing users’ queries to be evaluated directly in the materialisation. This process, however, can be computationally intensive, so most systems update the materialisation incrementally w

  • A Forward Algorithm for Solving Optimal Stopping Problems

    سند علمی۲۰۰۶ALBRECHT IRLE

    We consider the optimal stopping problem for g(Zn), where Zn, n = 1, 2, . . . , is a homogeneous Markov sequence. An algorithm, called forward improvement iteration, is presented by which an optimal stopping time can be computed. Using an iterative step, this algorithm computes a

  • A Truthful Geographic Forwarding Algorithm for Ad-hoc Networks with Selfish Nodes

    سند علمی۲۰۰۷I. J. Network SecurityYongwei Wang, Venkata C. Giruka, Mukesh Singhal

    Geographic routing algorithms for ad-hoc networks exhibit better scalability compared to topology-based routing algorithms. However, geographic routing algorithms assume a cooperative network setting for ad-hoc networks. In this paper, we present TGF, a truthful geographic forwar

  • A Utility-based Multi-copy Forwarding Algorithm in Delay Tolerant Networks

    سند علمی۲۰۱۴Cong Liu, Yan Pan, Jun Zhang, Jiacheng Zhuo

    In delay tolerant networks (DTNs) with uncertainty in node mobility, message forwarding usually employs a multi-copy, opportunistic forwarding scheme to improve delivery probability. Minimizing the delivery latency (delay) and minimizing the number of forwardings (message copies)

  • A Machine Learning Based Forwarding Algorithm Over Cognitive Radios in Wireless Mesh Networks

    سند علمی۲۰۱۶CoRRJianjun Yang, Ju Shen, Ping Guo, Bryson R. Payne

    Wireless Mesh Networks improve their capacities by equipping mesh nodes with multi-radios tuned to non-overlapping channels. Hence the data forwarding between two nodes has multiple selections of links and the bandwidth between the pair of nodes varies dynamically. Under this con