Publications associées à Recherche exhaustive

Modelling and solving a real-world truck-trailer scheduling problem in container transportation with separate moving objects

Container transportation is pivotal in global supply chains, facilitating the exchange of goods between companies across different countries. Given the exceedingly high operational costs of transporting containers, optimizing itinerary schedules can yield ...

Springer India2024

Near Collision Attack Against Grain V1

Subhadeep Banik, Willi Meier, Daniel Patrick Collins

A near collision attack against the Grain v1 stream cipher was proposed by Zhang et al. in Eurocrypt 18. The attack uses the fact that two internal states of the stream cipher with very low hamming distance between them, produce similar keystream sequences ...

2023

Hybrid Flock - Formation Control Algorithms

Alcherio Martinoli, Cyrill Silvan Baumann, Jonas Perolini, Emna Tourki

Two prominent categories for achieving coordinated multirobot displacement are flocking and navigation in formation. Both categories have their own body of literature and characteristics, including their respective advantages and disadvantages. While typic ...

Springer Nature Switzerland2022

Large-scale traffic signal control and multimodal network design

Dimitrios Tsitsokas

Traffic congestion constitutes one of the most frequent, yet challenging, problems to address in the urban space. Caused by the concentration of population, whose mobility needs surpass the serving capacity of urban networks, congestion cannot be resolved ...

EPFL2022

An Analysis of Super-Net Heuristics in Weight-Sharing NAS

Mathieu Salzmann, Kaicheng Yu

Weight sharing promises to make neural architecture search (NAS) tractable even on commodity hardware. Existing methods in this space rely on a diverse set of heuristics to design and train the shared-weight backbone network, a.k.a. the super-net. Since he ...

IEEE COMPUTER SOC2022

Uniform parsing for hyperedge replacement grammars

Petter Harald Ericson

It is well known that hyperedge-replacement grammars can generate NP-complete graph languages even under seemingly harsh restrictions. This means that the parsing problem is difficult even in the non-uniform setting, in which the grammar is considered to b ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2021

Bias free multiobjective active learning for materials design and discovery

Berend Smit, Kevin Maik Jablonka, Shi-Lin Wang

The design rules for materials are clear for applications with a single objective. For most applications, however, there are often multiple, sometimes competing objectives where there is no single best material and the design rules change to finding the se ...

Nature Research2021

Partially-supervised Mention Detection

James Henderson

Learning to detect entity mentions without using syntactic information can be useful for integration and joint optimization with other tasks. However, it is common to have partially annotated data for this problem. Here, we investigate two approaches to de ...

ACL2020

An Optimal Planning Framework to Deploy Self-Reconfigurable Modular Robots

Auke Ijspeert, Mehmet Hasan Mutlu, Simon Lukas Hauser, Hala Khodr, Alexandre Bernardino

Self-reconfiguration is a hard problem due to the high dimensionality of self-reconfigurable modular systems. Searchbased approaches offer complete and optimal solutions. However, naive search algorithms cannot directly solve self-reconfiguration tasks in ...

2019

DESIA: A General Framework for Designing Interlocking Assemblies

Mark Pauly, Peng Song

Interlocking assemblies have a long history in the design of puzzles, furniture, architecture, and other complex geometric structures. The key defining property of interlocking assemblies is that all component parts are immobilized by their geometric arran ...

2018

DESIA: A General Framework for Designing Interlocking Assemblies

Mark Pauly, Peng Song

Interlocking assemblies have a long history in the design of puzzles, furniture, architecture, and other complex geometric structures. The key defining property of interlocking assemblies is that all component parts are immobilized by their geometric arran ...

ASSOC COMPUTING MACHINERY2018

Unlabeled Sensing: Reconstruction Algorithm and Theoretical Guarantees

Martin Vetterli, Benjamin Bejar Haro, Adam James Scholefield, Golnooshsadat Elhami

It often happens that we are interested in reconstructing an unknown signal from partial measurements. Also, it is typically assumed that the location (temporal or spatial) of the samples is known and that the only distortion present in the observations is ...

Ieee2017

Early-stage decision making approach for the selection of optimally integrated biorefinery processes

François Maréchal, Adriano Viana Ensinas, Shivom Sharma, Ayse Dilan Celebi

Lignocellulosic biorefineries are the best non-petroleum alternatives for a sustainable development. In the biorefinery process design, it is important to implement an algorithm that allows the systematic generation and the evaluation of energy conversion ...

2017

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 KATAN, LBLOCK and SIMON. Fo ...

Springer Verlag2016

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

Serge Vaudenay, Sonia Mihaela Bogos

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