Function spaces from Lawson compact continuous domains to continuous B-domains

Sweeping with Continuous Domains

The geost constraint has been proposed to model and solve discrete placement problems involving multi-dimensional boxes (packing in space and time). The filtering technique is based on a sweeping algorithm that requires the ability for each constraint to compute a forbidden box around a given fixed point and within a surrounding area. Several cases have been studied so far, including integer li...

Symmetric continuous Reinhardt domains

whenever |ζ1|, . . . , |ζn| ≤ 1 . In 1974 [11] Sunada investigated the structure of bounded Reinhardt domains containing the origin from the viewpoint of biholomorphic equivalence. He was able to describe completely the symmetric Reihardt domains which, up to linear isomomorphism, turned to be direct products of Euclidean balls. Our aim in this paper is to study infinite dimensional analogs of ...

Continuous Lattices and Domains

In order to give the book under review the right appreciation it is necessary to first say a few words about its predecessor, the monograph A Compendium of Continuous Lattices which was published by the same six authors in 1980. The Compendium, as it is commonly called, contains a rather complete and very readable account of the theory of continuous lattices as is was known by that time. It has...

Learning from Experience in Continuous Domains

Agents existing in a continuous domain require a great deal of speciic, detailed knowledge. Providing that information to the agent manually is time-consuming and error-prone, so it is desirable to enable the agent to automatically learn to accomplish its goals. However, performance in the early stages of learning is characterized by many errors and random guessing, slowing the learning rate. T...

A new class of function spaces on domains of R^d and its relations to classical function spaces