Sciweavers

2062 search results - page 35 / 413
» Derivatives of Logical Formulas
Sort
View
PADO
2001
Springer
15 years 3 months ago
Deriving Pre-conditions for Array Bound Check Elimination
Abstract. We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant ch...
Wei-Ngan Chin, Siau-Cheng Khoo, Dana N. Xu
CORR
2011
Springer
149views Education» more  CORR 2011»
14 years 2 months ago
Intensionality and Two-steps Interpretations
In this paper we considered the extension of the First-order Logic Bealer’s intensional abstraction operator. Contemporary use of the term ’intension’ derives from the tradit...
Zoran Majkic
COMBINATORICS
2007
79views more  COMBINATORICS 2007»
14 years 10 months ago
On the Spectrum of the Derangement Graph
We derive several interesting formulae for the eigenvalues of the derangement graph and use them to settle affirmatively a conjecture of Ku regarding the least eigenvalue.
Paul Renteln
MOC
2002
84views more  MOC 2002»
14 years 10 months ago
On the least prime primitive root modulo a prime
We derive a conditional formula for the natural density E(q) of prime numbers p having its least prime primitive root equal to q, and compare theoretical results with the numerical...
A. Paszkiewicz, Andrzej Schinzel
ORL
2007
54views more  ORL 2007»
14 years 10 months ago
Stationary remaining service time conditional on queue length
In Mandelbaum and Yechiali (1979) a simple formula is derived for the expected stationary remaining service time in a FIFO M/G/1 queue, conditional on the number of customers
Karl Sigman, Uri Yechiali