Publications related to Brute-force search

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

Thanh Trung Huynh, Van Son Nguyen

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 ...

New Delhi2024

Near Collision Attack Against Grain V1

Daniel Patrick Collins, Subhadeep Banik, Willi Meier

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 ...

2022

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

Efficient Massively Parallel Join Optimization for Large Queries

Anastasia Ailamaki, Bikash Chandra, Srinivas Karthik Venkatesh, Riccardo Mancini, Vasileios Mageirakos

Modern data analytical workloads often need to run queries over a large number of tables. An optimal query plan for such queries is crucial for being able to run these queries within acceptable time bounds. However, with queries involving many tables, find ...

2022

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

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

Mika Tapani Göös

We study the search problem class PPA_q defined as a modulo-q analog of the well-known polynomial parity argument class PPA introduced by Papadimitriou (JCSS 1994). Our first result shows that this class can be characterized in terms of PPA_p for prime p. ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2020

Chat with Graph Search

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.

Brute-force search

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

Near Collision Attack Against Grain V1

Hybrid Flock - Formation Control Algorithms

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

Efficient Massively Parallel Join Optimization for Large Queries

Uniform parsing for hyperedge replacement grammars

Bias free multiobjective active learning for materials design and discovery

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

Partially-supervised Mention Detection

Centralized or Decentralized? The Contact Tracing Dilemma

Graph Chatbot

Chat with Graph Search

Near Collision Attack Against Grain V1

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

Partially-supervised Mention Detection

Uniform parsing for hyperedge replacement grammars

Bias free multiobjective active learning for materials design and discovery

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

Hybrid Flock - Formation Control Algorithms

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

Efficient Massively Parallel Join Optimization for Large Queries

Centralized or Decentralized? The Contact Tracing Dilemma