Interval arithmetic is arithmetic for continuous sets. Floating-point intervals are intervals of real numbers with floating-point bounds. Operations for intervals can be efficiently implemented. Hence, the time is ripe for standardization. In this paper we present an interval model that is mathematically sound and closed for the 4 basic operations. The model allows for exception free interval a...

Let G be an interval graph and take one of its vertices x. Can we find in linear time a minimum number of vertex disjoint paths of G which cover the vertex set of G and have x as one of their endpoints? This paper provides a positive answer to this problem. In the course of developing such an algorithm, we explore the possibility of getting insight on the path structure of interval graphs via g...

In two experiments conducted in an eight-arm radial maze, food pellets were delivered when a photocell beam was broken at the end of each arm via a nose poke, according to either fixed-interval or random-interval schedules of reinforcement, with each arm providing a different frequency of reinforcement. The behavior of rats exposed to these procedures was well described by the generalized match...

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...

This paper discusses the least-squares linear filtering and smoothing (fixed-point and fixed-interval) problems of discrete-time signals from observations, perturbed by additive white noise, which can be randomly delayed by one sampling time. It is assumed that the Bernoulli random variables characterizing delay measurements are correlated in consecutive time instants. The marginal distribution...