Succinct ordering and aggregation constraints in algebraic array theories
Graph Chatbot
Chattez avec Graph Search
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.
A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time approximability of two related optimization problems called the maximum rooted triplets ...
We investigate the dynamic behavior of concrete in relation to its composition within a computational framework (FEM). Concrete is modeled using a meso-mechanical approach in which aggregates and mortar are represented explicitly. Both continuum phases are ...
Games on graphs with omega-regular objectives provide a model for the control and synthesis of reactive systems. Every omega-regular objective can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens " ...
Chapter in the exhibition catalogue outlining the instigation and concept for the creation of the exhibition at the Biennale. The text focuses on the relation of urban development in Bahrain with the traditional and cultural connection to water and the sea ...
We consider the problem of testing whether the maximum integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed as a generalization of the integer rounding property, which can be tested in polynomi ...
In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if the number of different colors is 3. Previously, it has only been known that it is NP-co ...
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergraphs have bounded GHW are known to be solvable in polynomial time. However, i ...
We describe a decision procedure for a logic that supports 1) finite collections of elements (sets or multisets), 2) the cardinality operator, 3) a total order relation on elements, and 4) min and max operators on entire collections. Among the applications ...
The relation between the near–field and far–field properties of plasmonic nanostructures that exhibit Fano resonances is investigated in detail. We show that specific features visible in the asymmetric lineshape far–field response of such structures origin ...
The project is developed around a central courtyard in response to the site where it is located, while taking advantage of the existing slope to resolve the position of the singular buildings in relation to the system of grouping classrooms; the direct con ...
