Publications associées à Fibonacci Heaps

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.

A continuum approximation approach to the depot location problem in a crowd-shipping system

Nikolaos Geroliminis, Patrick Stefan Adriaan Stokkink

Last-mile delivery in the logistics chain contributes to congestion in urban networks due to frequent stops. Crowd-shipping is a sustainable and low-cost alternative to traditional delivery but relies heavily on the availability of occasional couriers. In ...

PERGAMON-ELSEVIER SCIENCE LTD2023

Detailed Heap Profiling

James Richard Larus, Stuart Anthony Byma

Modern software systems heavily use the memory heap. As systems grow more complex and compute with increasing amounts of data, it can be difficult for developers to understand how their programs actually use the bytes that they allocate on the heap and whe ...

ACM2018

Detailed heap profiling

James Richard Larus, Stuart Anthony Byma

ACM2018

Limitations of Partial Compaction: Towards Practical Bounds

Nachshon Cohen

Compaction of a managed heap is a costly operation to be avoided as much as possible in commercial runtimes. Instead, partial compaction is often used to defragment parts of the heap and avoid space blowup. Previous study of compaction limitation provided ...

Assoc Computing Machinery2017

Learning heat diffusion graphs

Pascal Frossard, Daniel Kressner, Xiaowen Dong

Effective information analysis generally boils down to properly identifying the structure or geometry of the data, which is often represented by a graph. In some applications, this structure may be partly determined by design constraints or pre-determined ...

Ieee-Inst Electrical Electronics Engineers Inc2017

Synthesizing efficient systems in probabilistic environments

Barbara Jobstmann, David Parker

We present a formalism, algorithms and tools to synthesise reactive systems that behave efficiently, i.e., which achieve an optimal trade-off between a given cost and reward model. Synthesis aims to automatically generate a program from a specification. Mo ...

Springer2016

Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures

Rachid Guerraoui, Vasileios Trigonakis, Tudor Alexandru David

We introduce "asynchronized concurrency (ASCY),'' a paradigm consisting of four complementary programming patterns. ASCY calls for the design of concurrent search data structures (CSDSs) to resemble that of their sequential counterparts. We argue that ASCY ...

2015

Symbolic Resource Bound Inference

Viktor Kuncak, Ravichandhran Kandhadai Madhavan

We present an approach for inferring symbolic resource bounds for purely functional programs consisting of recursive functions, algebraic data types and nonlinear arithmetic operations. In our approach, the developer specifies the desired shape of the boun ...

2014

Fibonacci Heaps

Graph Chatbot

Chattez avec Graph Search

A continuum approximation approach to the depot location problem in a crowd-shipping system

Sketches, metrics and fast algorithms

Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures

Detailed Heap Profiling

Detailed heap profiling

Limitations of Partial Compaction: Towards Practical Bounds

Learning heat diffusion graphs

Synthesizing efficient systems in probabilistic environments

Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures

Symbolic Resource Bound Inference

A continuum approximation approach to the depot location problem in a crowd-shipping system

Sketches, metrics and fast algorithms

Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures

Detailed heap profiling

Limitations of Partial Compaction: Towards Practical Bounds

Detailed Heap Profiling

Learning heat diffusion graphs

Synthesizing efficient systems in probabilistic environments

Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures

Symbolic Resource Bound Inference