• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 840
Next 10 →

Reasoning with Recursive Loops under the PLP Framework

by Yi-dong Shen
"... Recursive loops in a logic program present a challenging problem to the PLP (Probabilistic Logic Programming) framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never stop. On the other hand, they may generate cyclic influences, which are disallowed in B ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Recursive loops in a logic program present a challenging problem to the PLP (Probabilistic Logic Programming) framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never stop. On the other hand, they may generate cyclic influences, which are disallowed

Performance Analysis of a Recursive Loop Scheduler for

by Class-Based Scheduling Raphael, Raphael Rom, Moshe Sidi, Hwee Pink Tan
"... In this paper, we consider the problem of determining a cyclic (or loop) scheduler that allocates slots to flows as periodically as possible. We use the second moment of the inter-allocation distance for each flow as its periodicity metric. We establish the optimality of a Weighted-Round Robin wit ..."
Abstract - Add to MetaCart
In this paper, we consider the problem of determining a cyclic (or loop) scheduler that allocates slots to flows as periodically as possible. We use the second moment of the inter-allocation distance for each flow as its periodicity metric. We establish the optimality of a Weighted-Round Robin

Recursive Loop-Free Alternates for Full Protection Against Transient Link Failures

by Suksant Sae Lor, Redouane Ali, Raul L, Miguel Rio
"... Abstract—In this paper, we propose a routing technique, “recursive Loop-Free Alternates (rLFAs)”, to alleviate packet loss due to transient link failures. The technique consists of a backup path calculation with corresponding re-routing scheme based on the Loop-Free Condition (LFC) as defined in the ..."
Abstract - Add to MetaCart
Abstract—In this paper, we propose a routing technique, “recursive Loop-Free Alternates (rLFAs)”, to alleviate packet loss due to transient link failures. The technique consists of a backup path calculation with corresponding re-routing scheme based on the Loop-Free Condition (LFC) as defined

Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops

by Yi-dong Shen, Qiang Yang
"... Abstract. 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, ..."
Abstract - Add to MetaCart
Abstract. 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

Direct proof of tree-level recursion relation in Yang-Mills theory

by Ruth Britto, Freddy Cachazo, Bo Feng, Edward Witten , 2005
"... Recently, by using the known structure of one-loop scattering amplitudes for gluons in Yang-Mills theory, a recursion relation for tree-level scattering amplitudes has been deduced. Here, we give a short and direct proof of this recursion relation based on properties of tree-level amplitudes only. ..."
Abstract - Cited by 266 (13 self) - Add to MetaCart
Recently, by using the known structure of one-loop scattering amplitudes for gluons in Yang-Mills theory, a recursion relation for tree-level scattering amplitudes has been deduced. Here, we give a short and direct proof of this recursion relation based on properties of tree-level amplitudes only.

Gestalt Rm'ew, 1(3):256-269,1997 The "Recursive LOOP " of Shame: An Alternate Gestalt Therapy Viewpoint

by Robert W. Resnick, Ph. D
"... Shame has become the issue "de jour " of psychotherapy-the alleged cause of almost all psychological difficulties. Too much of the Gestalt therapy shame literature appears to have abandoned our integrative worldview-self regulation, field theory, phenomenology, and dialogue. Eclips ..."
Abstract - Add to MetaCart
Shame has become the issue "de jour " of psychotherapy-the alleged cause of almost all psychological difficulties. Too much of the Gestalt therapy shame literature appears to have abandoned our integrative worldview-self regulation, field theory, phenomenology, and dialogue. Eclipsed with superimposed "expert " theory and practice, the client's phenomenological experience is frequently overruled in favor of interpre-tation, for example, of "hidden shame. " Many clinical applications are themselves accused of being a source of further shaming. Clinical work u u that goes beyond the therapist's nonshaming acceptance and/or the expression of unfinished business is discussed. In the waters of shame, these are the views of a Gestalt salmon. If the only tool you have is a hammer, you tend to see every problem as a nail (Abraham Maslow, Pearls of Wisdom). D URING THE PAST 15 YEARS OR SO, there has been an ever-increasing rush of activity and interest in shame, first in the popular psychology literature (e.g., Bradshaw), and then in the psychoanalytic professional literature (e.g., Lewis, 1992; Kaufman, 1989; Nathanson, 1987) and in the Gestalt therapy professional literature (e.g.,

Design and analysis of a class-aware recursive loop scheduler for class-based scheduling. Elsevier Journal of Performance Evaluation, 63(9–10), 839–863. Author Biographies Raphael Rom received the B.Sc. and M.Sc. degrees in Electrical Engineering from the

by Raphael Rom, Moshe Sidi, Hwee Pink Tan - Center and Stanford University , 2006
"... In this paper, we consider the problem of devising a loop scheduler that allocates slots to users according to their relative weights as smoothly as possible. Instead of the existing notion of smoothness based on balancedness, we propose a variance-based metric which is more intuitive and easier to ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
to compute. We propose a recursive loop scheduler for a class-based scheduling scenario based on an optimal Weighted Round Robin scheduler. We show that it achieves very good allocation smoothness with almost no degradation in intra-class fairness. In addition, we also demonstrate the equivalence between our

Detecting Parallelism in C Programs with Recursive Data Structures

by Rakesh Ghiya, Laurie Hendren, Yingchun Zhu - IEEE Transactions on Parallel and Distributed Systems , 1998
"... In this paper we present techniques to detect three common patterns of parallelism in C programs that use recursive data structures. These patterns include, function calls that access disjoint sub-pieces of tree-like data structures, pointer-chasing loops that traverse list-like data structures, and ..."
Abstract - Cited by 168 (13 self) - Add to MetaCart
In this paper we present techniques to detect three common patterns of parallelism in C programs that use recursive data structures. These patterns include, function calls that access disjoint sub-pieces of tree-like data structures, pointer-chasing loops that traverse list-like data structures

The Static Parallelization of Loops and Recursions

by Christian Lengauer, Sergei Gorlatch, Christoph A. Herrmann - In Proc. 11th Int. Symp. on High Performance Computing Systems (HPCS'97 , 1997
"... We demonstrate approaches to the static parallelization of loops and recursions on the example of the polynomial product. Phrased as a loop nest, the polynomial product can be parallelized automatically by applying a space-time mapping technique based on linear algebra and linear programming. One ca ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
We demonstrate approaches to the static parallelization of loops and recursions on the example of the polynomial product. Phrased as a loop nest, the polynomial product can be parallelized automatically by applying a space-time mapping technique based on linear algebra and linear programming. One

A comparative study of the behavioral deficits following lesions of various parts of the zebra finch song system: implications for vocal learning

by Constance Scharff, O Nottebohm - J Neurosci , 1991
"... Song production in song birds is controlled by an efferent pathway. Appended to this pathway is a “recursive loop” that is necessary for song acquisition but not for the pro-duction of learned song. Since zebra finches learn their song by imitating external models, we speculated that the impor-tance ..."
Abstract - Cited by 137 (9 self) - Add to MetaCart
Song production in song birds is controlled by an efferent pathway. Appended to this pathway is a “recursive loop” that is necessary for song acquisition but not for the pro-duction of learned song. Since zebra finches learn their song by imitating external models, we speculated that the impor
Next 10 →
Results 1 - 10 of 840
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University