๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Continuous accumulation games on discrete locations

โœ Scribed by Kensaku Kikuta; William H. Ruckle

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
135 KB
Volume
49
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Replacing continuous demand with discret
Replacing continuous demand with discrete demand in a competitive location model
โœ Tammy Drezner; Zvi Drezner ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 214 KB

Location models commonly represent demand as discrete points rather than as continuously spread over an area. This modeling technique introduces inaccuracies to the objective function and consequently to the optimal location solution. In this article this inaccuracy is investigated by the study of a

Continuous Functions on Discrete Valuati
Continuous Functions on Discrete Valuation Rings
โœ Koichi Tateyama ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 110 KB

Let R be a complete discrete valuation ring with finite residue field, let K be its quotient field. We construct polynomial functions .(n, a)(n=0, 1, ...) such that any continuous function f from R into K has the following expansion where the sequence [a n ]/K is uniquely determined by f and satisf

On a ruckle problem in discrete games of
On a ruckle problem in discrete games of ambush
โœ A.Y. Garnaev ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 88 KB ๐Ÿ‘ 1 views

The following zero-sum game is considered. Red chooses in integer interval [1, n] two integer intervals consisting of k and m points where k / m รต n, and Blue chooses an integer point in [1, n]. The payoff to Red equals 1 if the point chosen by Blue is at least in one of the intervals chosen by Red,

On the Relations Between Discrete and Co
On the Relations Between Discrete and Continuous Complexity Theory
โœ Klaus Meer ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 389 KB

A b s t r a c t . Relations between discrete and continuous complexity models are considered. The present paper is devoted to combine both models. In particular we analyze the 3-Satisfiability problem. The existence of fast decision procedures for this problem over the reds is examined based on cert