An edge coloring of a graph <img src="/cgi-bin/mimetex.cgi?G = (V,E)"> is a function <img src="/cgi-bin/mimetex.cgi?c:E \rightarrow N"> that assigns a co...

In this paper, we consider the problem of constructing confidence intervals for a population median when the underlying population is discrete. We describe ...

We consider the problem of assigning patients to nurses for home care services. The aim is to balance the workload of the nurses while avoiding long travels...

The probabilistic satisfiability problem is to verify the consistency of a set of probability values or intervals for logical propositions. The (tight) prob...

In this paper, we propose efficient algorithms to extract minimal unsatisfiable subsets of clauses or variables in unsatisfiable propositional formulas. Suc...

We consider the problem of determining the size of a maximum clique in a graph, also known as the clique number. Given any method that computes an upper bou...

In this paper, we consider testing the location parameter with multilevel (or hierarchical) data. A general family of weighted test statistics are introduced...

Let <i>G = (V,E)</i> be a graph with vertex set <i>V</i> and edge set <i>E</i>. The <i>k</i>-coloring problem is to assign a color (a number chosen in {1,.....

Many proposals have been made recently for goodness-of-fit testing of copula models. After reviewing them briefly, the authors concentrate on omnibus proced...

The problem retained for the ROADEF’99 international challenge was an inventory management problem for a car rental company. It consists in managing a given...

We discuss feature selection approaches within the context of linear programming models for discrimination, with special emphasis on a new interpretation an...

Using Clark-Ocone formula, explicit martingale representations for path-dependent Brownian functionals are computed. As direct consequences, explicit martin...

We develop a test of equality between two dependence structures estimated through empirical copulas. We provide inference for independent or paired samples....

A weighted spatial median is proposed for the multivariate location problem with cluster correlated data. Its limiting distribution is derived under mild co...

We investigate the common practice of estimating the dependence structure between CDS prices on multi-name credit instruments by the dependence structure of ...

Colour image quantization is a data compression technique that reduces the total set of colours in an image to a representative subset. This problem is expr...

This paper proposes new tests of randomness for innovations of a large class of time series models. These tests are based on functionals of empirical proces...

Past studies have shown the unstability of unstructured peer-to-peer networks, in particular Gnutella. Because of this unstability, queries in these network...

We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy ...

Let <img src="/cgi-bin/mimetex.cgi?G = (V,E,w)"> be a graph with vertex and edge sets <img src="/cgi-bin/mimetex.cgi?V"> and <img src="/cgi-bin/mimetex.cgi?E...