Publication

Variational Monte Carlo Calculations of A <= 4 Nuclei with an Artificial Neural-Network Correlator Ansatz

Related publications (39)

Graph Chatbot

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.

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Serge Vaudenay, Fatma Betül Durak

Feistel Networks (FN) are now being used massively to encrypt credit card numbers through format-preserving encryption. In our work, we focus on FN with two branches, entirely unknown round functions, modular additions (or other group operations), and when ...

ePrint2018

LPN in Cryptography

Sonia Mihaela Bogos

The security of public-key cryptography relies on well-studied hard problems, problems for which we do not have efficient algorithms. Factorization and discrete logarithm are the two most known and used hard problems. Unfortunately, they can be easily solv ...

EPFL2017

Integration of an IEEE Std. C37.118 compliant PMU into a real-time simulator

Mario Paolone, Paolo Romano, Marco Pignati

The simulation of Phasor Measurement Units (PMUs) into real-time simulators (RTSs) is typically limited by the complexity of the synchrophasor estimation (SE) algorithm. This is especially true when dealing with distribution network PMUs due to the more de ...

IEEE2015

Route choice models: bringing behavioral aspects into shortest path

Michel Bierlaire

An introduction to route choice models will be provided. The starting point will be a discussion of behavioral limitations of the shortest path algorithm. The theoretical assumptions necessary to derive behavioral models will be introduced. The complexity ...

2014

Ch.17 - Interface Protection

Lazar Bizumic

A coupling of the electrical networks of ENTSO-E and IPS/UPS would result in a power system unprecedented in size and complexity, and potentially could have severe effects on operation and stability. ...

Springer2014

Multi-Objective Quality-Driven Service Selection-A Fully Polynomial Time Approximation Scheme

Boi Faltings, Immanuel Trummer

The goal of multi-objective quality-driven service selection (QDSS) is to find service selections for a workflow whose quality-of-service (QoS) values are Pareto-optimal. We consider multiple QoS attributes such as response time, cost, and reliability. A s ...

Institute of Electrical and Electronics Engineers2014

The Minimal Complexity of Adapting Agents Increases with Fitness

What is the relationship between the complexity and the fitness of evolved organisms, whether natural or artificial? It has been asserted, primarily based on empirical data, that the complexity of plants and animals increases as their fitness within a part ...

Public Library Science2013

Neutralité et engagement. Les relations entre le Comité international de la Croix-Rouge et le gouvernement suisse pendant la Seconde Guerre mondiale

Isabelle Barbara Marie-Hélène Cardia

Since its creation in 1863, the ICRC has maintained a special relationship with Switzerland and its government, based on the pursuit of neutrality and on the perception of a common destiny. Such a perception and the adherence to shared political values wer ...

Société d'histoire de la Suisse romande2012

Complexity of the critical node problem over trees

Marco Di Summa

In this paper we deal with the critical node problem (CNP), i.e., the problem of searching for a given number K of nodes in a graph G, whose removal minimizes the (weighted or unweighted) number of connections between pairs of nodes in the residual graph. ...

2011

On the Construction of Polar Codes

Emre Telatar, Seyed Hamed Hassani, Ramtin Pedarsani

We consider the problem of efficiently constructing polar codes over binary memoryless symmetric (BMS) channels. The complexity of designing polar codes via an exact evaluation of the polarized channels to find which ones are "good" appears to be exponenti ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011