We consider the theoretical and numerical aspects of the quadrature rules associated with a sequence of polynomials generated by a special R II recurrence relation. We also look into some methods for generating the nodes ...

We give here an n-point Chebyshev-type rule of algebraic degree of precision n - 1, but having nodes that can be given explicitly. This quadrature rule also turns out to be one with an ''almost'' highest algebraic degree ...

We give here an n-point Chebyshev-type rule of algebraic degree of precision n - 1, but having nodes that can be given explicitly. This quadrature rule also turns out to be one with an ''almost'' highest algebraic degree ...

Discontinuous games, such as auctions, may require special tie-breaking rules to guarantee equilibrium existence. The best results available ensure equilibrium existence only in mixed strategy with endogenously defined ...

We prove a relation between two different types of symmetric quadrature rules, where one of the types is the classical symmetric interpolatory quadrature rules. Some applications of a new quadrature rule which was obtained ...

We prove a relation between two different types of symmetric quadrature rules, where one of the types is the classical symmetric interpolatory quadrature rules. Some applications of a new quadrature rule which was obtained ...

Mining of frequent patterns and association rules is a Data Mining task that aims to determine consistent relationships among elements in a transaction database. Algorithms that consider the absence of elements perform the ...

We consider multistage stochastic linear optimization problems combining joint dynamic probabilistic constraints with hard constraints. We develop a method for projecting decision rules onto hard constraints of wait-and-see ...

Resolving non-deterministic choices of choreographies is a crucial task. We introduce a novel notion of realisability for choreographies –called whole-spectrum implementation– that rules out deterministic implementations ...