Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Consider F is an element of C(RxX,Y) such that F(lambda, 0) = 0 for all lambda is an element of R, where X and Y are Banach spaces. Bifurcation from the line Rx{0} of trivial solutions is investigated in cases where F(lambda, center dot ) need not be Frech ...
This paper deals with a singular, nonlinear Sturm-Liouville problem of the form {A(x)u'(x)}'+ lambda u (x) = f (x, u(x), u'(x)) on (0,1) where A is positive on (0,1] but decays quadratically to zero as x approaches zero. This is the lowest level of degener ...
We prove that optimal traffic plans for the mailing problem in Rd are stable with respect to variations of the given coupling, above the critical exponent α=1−1/d, thus solving an open problem stated in the book Optimal transportation networks, by Bernot, ...
Graph-based methods for signal processing have shown promise for the analysis of data exhibiting irregular structure, such as those found in social, transportation, and sensor networks. Yet, though these systems are often dynamic, state-of-the-art methods ...
In this thesis, we developed a research direction that combines the theoretical concepts of complex networks with practical needs and applications in the field of transportation engineering.
As a first objective we analyzed the phenomenon of congestion pr ...
Listing all maximal cliques of a given graph has important applications in the analysis of social and biological networks. Parallelisation of maximal clique enumeration (MCE) algorithms on modern manycore processors is challenging due to the task-level par ...
Suppose k is a positive integer and X is a k-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most k sets. Suppose there is a function f(n) = o(n(2)) with the property that any ...
Graph-based methods for signal processing have shown promise for the analysis of data exhibiting irregular structure, such as those found in social, transportation, and sensor networks. Yet, though these systems are often dynamic, state-of-the-art methods ...