Search results for "Crete"

The Serial Property and Restricted Balanced Contributions in discrete cost sharing problems

2006

We show that the Serial Poperty and Restricted Balanced Contributions characterize the subsidy-free serial cost sharing method (Moulin (1995)) in discrete cost allocation problems.

Hores: A timetabling system for Spanish secondary schools

1995

Constructing a timetable is a difficult problem faced by every school every year. A feasible solution has to satisfy many different requirements and constraints. A good solution has to provide compact timetables for classes and teachers. In order to help the schools, we have developed HORES, a robust and flexible timetabling system suited to the needs of Spanish secondary schools. HORES runs on a PC and is fast and user-friendly. It may handle virtually every condition required by the schools and obtains good quality solutions in very short computing times. It also allows the user to modify interactively the solutions. HORES is now being used by schools with satisfactory results.

Comparacion numerica de algoritmos para calcular distribuciones estacionarias de cadenas de Markov finitas

1992

En este trabajo se estudia la eficiencia de un conjunto de algoritmos, exactos e iterativos, para el problema de obtener la distribucion estacionaria de una cadena de Markov homogenea, irreducible y finita. Se presentan los resultados computacionales obtenidos al resolver problemas de diferentes tipos y tamanos, aleatoriamente generados, asi como el tratamiento estadistico realizado sobre los mismos. Se ha comparado la estabilidad de estos algoritmos frente a la perdida de irreducibilidad y la existencia de estados transitorios mediante su aplicacion a 26 problemas test. El trabajo concluye con una discusion del comportamiento de los diversos algoritmos.

Estudio bayesiano de los periodos de ocupacion y desocupacion en una cola M/M/1/∞/FIFO en equilibrio

1986

En este articulo, para un modelo de colas M/M/1/8/FIFO en equilibrio, se obtiene la distribucion predictiva del tiempo de duracion de un periodo de ocupacion, y de desocupacion de la cola, asi como la distribucion predictiva final del numero de personas atendidas en un periodo de ocupacion, y la probabilidad de que este sea finito. Finalmente, dichos resultados se aplican en una linea de espera concreta.

Stochastic Learning for SAT- Encoded Graph Coloring Problems

2010

The graph coloring problem (GCP) is a widely studied combinatorial optimization problem due to its numerous applications in many areas, including time tabling, frequency assignment, and register allocation. The need for more efficient algorithms has led to the development of several GC solvers. In this paper, the authors introduce a team of Finite Learning Automata, combined with the random walk algorithm, using Boolean satisfiability encoding for the GCP. The authors present an experimental analysis of the new algorithm’s performance compared to the random walk technique, using a benchmark set containing SAT-encoding graph coloring test sets.

Graphical representation of some duality relations in stochastic population models

2007

We derive a unified stochastic picture for the duality of a resampling-selection model with a branching-coalescing particle process (cf. http://www.ams.org/mathscinet-getitem?mr=MR2123250) and for the self-duality of Feller's branching diffusion with logistic growth (cf. math/0509612). The two dual processes are approximated by particle processes which are forward and backward processes in a graphical representation. We identify duality relations between the basic building blocks of the particle processes which lead to the two dualities mentioned above.

Functional Data Analysis with R and Matlab by RAMSAY, J. O., HOOKER, G., and GRAVES, S.

2010

Searching for a strong double tracing in a graph

1998

Given a connected graph G, we present a polynomial algorithm which either finds a tour traversing each edge of G exactly two non-consecutive times, one in each direction, or decides that no such tour exists. The main idea of this algorithm is based on the modification of a proof given by Thomassen related to a problem proposed by Ore in 1951.

(φ, ψ)-weak contractions in intuitionistic fuzzy metric spaces

2014

The purpose of this paper is to extend the notion of (phi,psi)-weak contraction to intuitionistic fuzzy metric spaces, by using an altering distance function. We obtain common fixed point results in intuitionistic fuzzy metric spaces, which generalize several known results from the literature.

Inference based on the affine invariant multivariate Mann–Whitney–Wilcoxon statistic

2003

A new affine invariant multivariate analogue of the two-sample Mann–Whitney–Wilcoxon test based on the Oja criterion function is introduced. The associated affine equivariant estimate of shift, the multivariate Hodges-Lehmann estimate, is also considered. Asymptotic theory is developed to provide approximations for null distribution as well as for a sequence of contiguous alternatives to consider limiting efficiencies of the test and estimate. The theory is illustrated by an example. Hettmansperger et al. [9] considered alternative slightly different affine invariant extensions also based on the Oja criterion. The methods proposed in this paper are computationally more intensive, but surpri…