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.
The Locomotive Assignment Problem (LAP) is a class of planning and scheduling problems solved by assigning a fleet of locomotives to a network of trains. In the planning versions of the LAP, the type of consist (a group of linked locomotives) assigned to e ...
We prove that amenability of a discrete group is equivalent to dimension flatness of certain ring inclusions naturally associated with measure preserving actions of the group. This provides a group-measure space theoretic solution to a conjecture of Luck s ...
The present paper derives systems of partial differential equations that admit a quadratic zero curvature representation for an arbitrary real semisimple Lie algebra. It also determines the general form of Hamilton's principles and Hamiltonians for these s ...
The application of mortar methods in the framework of isogeometric analysis is investigated theoretically as well as numerically. For the Lagrange multiplier two choices of uniformly stable spaces are presented, both of them are spline spaces but of a diff ...
We review the research done in recent years in our group on the effects of nanostructure symmetry, and outline its relevance both for nanostructure physics and for computations of their electronic and optical properties. The exemples of C3v and C2v quantum ...
Researchers have argued that specialization within groups yields productivity gains. We evaluate this statement with a focus on groups of Ph.D. students. Using an established technique in computer science called Latent Dirichlet Allocation, we construct a ...
Institute of Electrical and Electronics Engineers2014
We compute L-2-Betti numbers of postliminal, locally compact, unimodular groups in terms of ordinary dimensions of reduced cohomology with coefficients in irreducible unitary representations and the Plancherel measure. This allows us to compute the L-2-Bet ...
We introduce a relative fixed point property for subgroups of a locally compact group, which we call relative amenability. It is a priori weaker than amenability. We establish equivalent conditions, related among others to a problem studied by Reiter in 19 ...
We show that Brauer classes of a locally solvable degree 4 del Pezzo surface X are vertical for some projection away from a plane g : X -> P-1, i.e., that every Brauer class is obtained by pullback from an element of Br k(P-1). As a consequence, we prove t ...
Systems and techniques for key management in mobile ad hoc networks are described. Pseudonyms are defined for group members of mobile ad hoc networks such that a pseudonym in a message can be deterministically identified with the sending device only by the ...