Cahiers du GERAD
Recherche
Liste chronologique
3083 résultats — page 119 de 155
We propose a new finite cone covering algorithm for concave minimization over a polytope, in which the cones are defined by extreme points of the polytope. ...
référence BibTeX
We study empirically the topology of the local minima of the 3-SAT problem. In particular, we analyze the size of the plateaus, their altitude, their attrac...
référence BibTeX
Different versions of the serial test for testing the uniformity and independence of vectors of successive values produced by a (pseudo)random number genera...
référence BibTeX
The problem of assigning locomotives to trains consists of selecting the types and number of engines that minimize the fixed and operational locomotive cost...
référence BibTeX
This article presents an overview of planning problems that arise in the design and dimensioning of survivable telecommunications networks using the Synchro...
référence BibTeX
This paper deals with the robust \({\cal H}^\infty\)
control problem for uncertain continuous-time linear time-delay system with Markovian jumping paramet...
Non-parametric estimation of smooth functions belonging to Sobolev classes is closely related to the problem of estimating the (infinite dimensional) mean o...
référence BibTeX
An important aspect of railway planning concerns the distribution of locomotives and cars in the network and their assignment to the scheduled trains. In th...
référence BibTeXÉtude des différentes pratiques de l'ingénierie concourante: une enquête dans l'industrie québécoise
Dans le cadre du projet de recherche franco-québécois "COPRAIC": COnception et PRoduction Accélérées dans un contexte d'Ingénierie Concourante, une enquête ...
référence BibTeX
We present branch and bound algorithms that enumerate in finite time all Nash equilibria for strategic and sequence form bimatrix games. For each forms, th...
référence BibTeX
This paper considers the placement of components onto printed circuit boards (PCB's) using surface mount technology. Multiple automatic placement machines, ...
référence BibTeX
Cet article décrit un problème d'horaires mensuels personnalisés pour les membres d'équipage (pilotes et officiers) en transport aérien. Ce problème consist...
référence BibTeX
We present a convergence proof of Tuy's cone splitting algorithm with a pure <img src="omega.gif" align=bottom>-subdivision strategy, for the minimization o...
référence BibTeX
ATM (Asynchronous Transfer Mode) is a new technology recently chosen by the ITU-T standard for broadband networks. Being a powerful and yet complex techno...
référence BibTeX
Dans le cadre du projet de recherche franco-québécois "COPRAIC": COnception et PRoduction Accélérées dans un contexte de l'Ingénierie Concourante, une enquê...
référence BibTeX
The minimax global asymptotic rate of convergence for the estimation of a hazard function in the presence of random right censoring is obtained using the li...
référence BibTeX
In this article, we examine least-cost for reaching the greenhouse gas emission reductions specified by ghe Kyoto protocol for three Canadian provinces, Ont...
référence BibTeX
We consider Nash equilibria as correlated equilibria and apply polyhedral theory to study extreme Nash equilibrium properties. We obtain an alternate proof ...
référence BibTeX
This paper considers the shortest path problem with waiting costs (SPWC) as an extension of the shortest path problem with time windows. The problem consis...
référence BibTeX
In this paper, we use the multi-region version of a detailed bottom-up model MARKAL, to explore avenues for reducing the cost of GHG abatement in North Amer...
référence BibTeX