نتایج جستجو برای: precedence

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

2014
Barbara G. Shinn-Cunningham

The Effects of Room Acoustics on Auditory Spatial Cues The signals reaching the listener’s ears directly from a sound source convey information about the source’s location (Blauert 1997; Schnupp et al. 2010). However, in ordinary settings, soon after the direct sound reaches the listener, reflected sound arrives from random directions, coming off of walls, floors, and other reflective surfaces....

2017
Manfred Droste Stefan Dück Dino Mandrioli Matteo Pradella

In the last years renewed investigation of operator precedence languages (OPL) led to discover important properties thereof: OPL are closed with respect to all major operations, are characterized, besides the original grammar family, in terms of an automata family and an MSO logic; furthermore they significantly generalize the well-known visibly pushdown languages (VPL). In another area of rese...

1997
Victor Luchangco

This paper presents a general framework for understanding precedence-based memory models, which are generalizations of standard multiprocessor models. Precedence-based models need not mention processes explicitly, and can express any conditions that rely only on some operations being required to precede other operations. We deene a generalized notion of sequential consistency and per-location s...

1996
Vladimir Pericliev

A system is descril)ed which learns fl'om examples the Linear Precedence rules in an Immedia te Dominance/Linear Precedence grammar . Given a particular hnmediate Dominance g rammar and hierarchies of feature values potentially rel evant for linearization (=the systelu's bias), the leanler generates appropriate naturM language expressions to be ewduated as positive or negative by a teacher, and...

2001
C. B. Eom

Larbalestier †§ N. Rogado*, K.A. Regan*, M.A. Hayward*, T. He*, J.S. Slusky*, K. Inumaru*, M.K. Haas* and R.J. Cava* † Department of Materials Science and Engineering, Univer-sity of Wisconsin, 1509 University Avenue, Madison, WI 53706 USA § Applied Superconductivity Center, University of Wisconsin, 1500 Engineering Drive, Madison, WI 53706 USA * Department of Chemistry and Princeton Materials ...

2013
Adil Ali

on Γ\H, parametrized as λw = w(w−1). Haas listed the w-values. Haas thought he was solving the differential equation (∆ − λ)u = 0. Stark and Hejhal observed zeros of ζ and of an L-function on Haas’ list. This suggested an approach to proving the Riemann Hypothesis, since it seemed that zeros w of ζ might give eigenvalues λ = w(w − 1) of ∆. Since ∆ is a self-adjoint, nonpositive operator, these ...

Journal: :European Journal of Operational Research 2013
Shunji Tanaka Shun Sato

This study proposes an exact algorithm for the precedence-constrained singlemachine scheduling problem to minimize total job completion cost where machine idle time is forbidden. The proposed algorithm is an extension of the authors’ previous algorithms for the problem without precedence-constraints and is based on the SSDP (Successive Sublimation Dynamic Programming) method. Numerical experime...

2000
D. Gries Franklin L. DeRemer

A class of context-free grammars, called the "Simple LR(k)" or SLR(k) grammars is defined. This class has been shown to include weak precedence and simple precedence grammars as proper subsets. How to construct parsers for the SLR(k) grammars is also shown. These parser-construction techniques are extendible to cover all of the LR(k) grammars of Knuth; they have been implemented and by direct c...

1994
Gerhard Fohler Christian Huber

In this paper we present an approach to speciication and veriication of distributed hard real-time systems. By integrating RTL and precedence constraints, we combine the comprehensiveness of precedence graphs with the expressive power and proofability of RTL. Thus, our approach allows easy comprehension by the human designer and formal correctness. We propose to use a static scheduling algorith...

1999
Stephen Y. Chen Stephen F. Smith

Crossover operators that preserve common components can also preserve representation level constraints. Consequently, these constraints can be used to beneficially reduce the search space. For example, in flow shop scheduling problems with order-based objectives (e.g. tardiness costs and earliness costs), search space reductions have been implemented with precedence constraints. Experiments sho...

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

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