Type-Level Programming with Match Types

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.

FLUKA is a general purpose Monte Carlo code able to describe the transport and interaction of any particle and nucleus type in complex geometries over an energy range extending from thermal neutrons to ultrarelativistic hadron collisions. It has many diffe ...

While the basic greedy algorithm gives a semi-streaming algorithm with an approximation guarantee of 2 for the unweighted matching problem, it was only recently that Paz and Schwartzman obtained an analogous result for weighted instances. Their approach is ...

Most logic synthesis algorithms work on graph representations of logic functions with nodes associated with arbitrary logic expressions or simple logic functions and iteratively optimize such graphs. While recent multilevel logic synthesis efforts focused ...

Given the increasing ubiquity of online embedded devices, analyzing their firmware is important to security, privacy, and safety. The tight coupling between hardware and firmware and the diversity found in embedded systems makes it hard to perform dynamic ...

The expansion of 3D real-time simulations (3DRTS) into millions of homes together with the technical progress of computers hardware force to approach software developments for 3DRTS from different perspectives. From an historical standpoint, 3DRTS started ...

Preference-based search is the problem of finding an item that matches best with a user's preferences. User studies show that example-based tools for preference-based search can achieve significantly higher accuracy when they are complemented with suggesti ...

Type-Level Programming with Match Types

Chattez avec Graph Search

New Capabilities of the FLUKA Multi-Purpose Code

Semi-streaming algorithms for submodular matroid intersection

Three-Input Gates for Logic Synthesis

HALucinator: Firmware Re-hosting Through Abstraction Layer Emulation

2019 International Symposium on Low Power Electronics and Design

A multitasking and data-driven architecture for multi-agents simulations

The lookahead principle for preference elicitation: Experimental results