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.
Flow simulations in pipelined channels and several kinds of parametrized configurations have a growing interest in many life sciences and industrial applications. Applications may be found in the analysis of the blood flow in specific compartments of the c ...
We present an extension of Scala that supports constraint programming over bounded and unbounded domains. The resulting language, Kaplan, provides the benefits of constraint programming while preserving the existing features of Scala. Kaplan integrates con ...
ACM Order Department, P O Box 64145, Baltimore, MD 21264 Usa2012
We present an extension of Scala that supports constraint programming over bounded and unbounded domains. The resulting language, Kaplan, provides the benefits of constraint programming while preserving the existing features of Scala. Kaplan integrates con ...
Previously, G. Cornuejols and M. Dawande (1998) proposed a set of 0-1 linear programming instances that proved to be very hard to solve by traditional methods, and in particular by linear programming based branch-and-bound. They offered these market split ...
This paper describes a backtracking algorithm for the enumeration of nonisomorphic minimally nonideal (n2n) matrices that are not degenerate projective planes. The application of this algorithm for nh12 yielded 20 such matrices, adding 5 matrices to the 15 ...
We present a method that is based on the Ladd-Frenkel (LF) thermodynamic integration for the study of the rigidity of networks of particles bonded together by short-ranged square well attractive potentials. We show that, by taking the limit of the attracti ...
In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Another one is the convex hull problem: Given a set of 0/1 points in dimension d, ...
The 3-regular nets with 4 and 6 vertices per unit cell are enumerated. The large number of nets obtained (5 nets and 269 nets resp.) is in stark contrast to the relatively small number of nets which are of crystallographic interest. This subset of crystall ...
Let T be a triangulated surface given by the list of vertex-triples of its triangles, called rooms. A room-partitioning of T is a subset R of the rooms such that each vertex of T is in exactly one room in R. We prove that if T has a room-partitioning R, th ...
Printed circuits in bounded media encompass a wide range of practical structures such as discontinuities in waveguides, planar circuits embedded in shielded multilayered media or even two-dimensional printed periodic structures. The Electromagnetic (EM) mo ...
