Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
This work is concerned with the computational complexity of the recognition of \mboxLP2, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Several subclasses of \mboxLP2 of particular interest ...
The common point between the different chapters of the present work is graph theory. We investigate some well known graph theory problems, and some which arise from more specific applications. In the first chapter, we deal with the maximum stable set probl ...
Unconstrained zero-one quadratic maximization problems can be solved in polynomial time when the symmetric matrix describing the objective function is positive semidefinite of fixed rank with known spectral decomposition. ...
The equipartition problem on an undirected graph G=(V,E) with n nodes and a system of edge weights, is to find a subset of [n/2] nodes such as the associate cut has a smallest cost. We present a polynomial algorithm to solve the equipartition problem on a ...
Constraint Satisfaction Problems (CSPs) are ubiquitous in computer science. Many problems, ranging from resource allocation and scheduling to fault diagnosis and design, involve constraint satisfaction as an essential component. A CSP is given by a set of ...
An in-situ, mid-IR sensor was used to monitor the major analyte concns. involved in the cultivation of Gluconacetobacter xylinus and the prodn. of gluconacetan, a food-grade exopolysaccharide. To predict the analyte concns., three different sets of std. sp ...
In 1982 a polynomial-time algorithm for factoring polynomials in one variable with rational coefficients was published (see A.K. Lenstra, H.W. Lenstra, Jr. and L. Lovasz, Math. Ann., vol.261, p.515-34, 1982). This L3-algorithm came as a r ...
Simultaneous link failures are common in IP networks \cite{Markopoulou04}. In this paper, we develop a technique for locating multiple failures in Service Provider or Enterprise IP networks using active measurement. We propose a two-phased approach that mi ...
