Concept

Recherche exhaustive

Publications associées (55)

How to Sequentialize Independent Parallel Attacks? - Biased Distributions Have a Phase Transition

We assume a scenario where an attacker can mount several independent attacks on a single CPU. Each attack can be run several times in independent ways. Each attack can succeed after a given number of steps with some given and known probability. A natural q ...

2015

Improving the efficiency of branch-and-bound complete-search NMR assignment using the symmetry of molecules and spectra

Luc Patiny, Julien Wist, Andrés Mauricio Castillo Robles

Nuclear magnetic resonance (NMR) assignment of small molecules is presented as a typical example of a combinatorial optimization problem in chemical physics. Three strategies that help improve the efficiency of solution search by the branch and bound metho ...

Amer Inst Physics2015

Integrated Design and Multi-objective Optimization of a Single Stage Heat-Pump Turbocompressor

Jürg Alexander Schiffmann

Small-scale turbomachines in domestic heat pumps reach high efficiency and provide oil-free solutions, which improve heat-exchanger performance and offer major advantages in the design of advanced thermodynamic cycles. An appropriate turbocompressor for do ...

Asme2015

Viability Principles for Constrained Optimization Using a (1+1)-CMA-ES

Dario Floreano, Andrea Maesani

Viability Evolution is an abstraction of artificial evolution which operates by eliminating candidate solutions that do not satisfy viability criteria. Viability criteria are defined as boundaries on the values of objectives and constraints of the problem ...

Springer International Publishing2014

On Selection of Samples in Algebraic Attacks and a New Technique to Find Hidden Low Degree Equations

Serge Vaudenay, Pouyan Sepehrdad, Petr Susil

The best way of selecting samples in algebraic attacks against block ciphers is not well explored and understood. We introduce a simple strategy for selecting the plaintexts and demonstrate its strength by breaking reduced-round KATAN32 and LBlock. In both ...

Springer-Verlag Berlin2014

Completeness and Ambiguity of Schema Cover

Karl Aberer, Quoc Viet Hung Nguyen, Zoltán Miklós

Given a schema and a set of concepts, representative of entities in the domain of discourse, schema cover deﬁnes correspondences between concepts and parts of the schema. Schema cover aims at interpreting the schema in terms of concepts and thus, vastly si ...

2013

Interchangeability with thresholds and degradation factors for Soft CSPs

Boi Faltings, Nicoleta Neagu

Substitutability and interchangeability in constraint satisfaction problems (CSPs) have been used as a basis for search heuristics, solution adaptation and abstraction techniques. In this paper, we consider how the same concepts can be extended to soft con ...

Springer2013

Fast encoding techniques for Multiview Video Coding

Pascal Frossard

Multiview Video Coding (MVC) is a technique that permits efficient compression of multiview video. MVC uses variable block size motion and disparity estimation for block matching. This requires an exhaustive search process that involves all possible macro- ...

Elsevier Science Bv2013

Scala to the Power of Z3: Integrating SMT and Programming

Viktor Kuncak, Philippe Paul Henri Suter

We describe a system that integrates the SMT solver Z3 with the Scala programming language. The system supports the use of the SMT solver for checking satisfiability, unsatisfiability, as well as solution enumeration. The embedding of formula trees into Sc ...

Springer-Verlag Berlin2011

Optimisation of solar energy utilisation potential in the urban context

Jérôme Henri Kämpf, Darren Robinson

Around three quarters of global resource consumption takes place in urban settlements, with corresponding adverse environmental consequences. According to population forecasts this situation will be exacerbated during the coming years. It is therefore impe ...

2010

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.

Connectez-vous pour utiliser Chat avec Graph Search