Publications related to Double-ended queue

Contract-Based Resource Verification for Higher-Order Functions with Memoization

Viktor Kuncak, Ravichandhran Kandhadai Madhavan, Sumith Kulal

We present a new approach for specifying and verifying resource utilization of higher-order functional programs that use lazy evaluation and memoization. In our approach, users can specify the desired resource bound as templates with numerical holes e.g. a ...

Assoc Computing Machinery2017

3D dynamic fragmentation with parallel dynamic insertion of cohesive elements

Jean-François Molinari, Nicolas Richart, Marco Vocialta

Dynamic fragmentation is a rapid and catastrophic failure of a material. During this process, the nucleation, propagation, branching, and coalescence of cracks results in the formation of fragments. The numerical modeling of this phenomenon is challenging ...

2017

Squid: Type-Safe, Hygienic, and Reusable Quasiquotes

Christoph Koch, Amir Shaikhha, Lionel Emile Vincent Parreaux

Quasiquotes have been shown to greatly simplify the task of metaprogramming. This is in part because they hide the data structures of the intermediate representation (IR), instead allowing metaprogrammers to use the concrete syntax of the language they man ...

ACM2017

Verifying Resource Bounds of Programs with Lazy Evaluation and Memoization

Viktor Kuncak, Ravichandhran Kandhadai Madhavan, Sumith Kulal

We present a new approach for specifying and verifying resource utilization of higher-order functional programs that use lazy eval- uation and memoization. In our approach, users can specify the desired resource bound as templates with numerical holes e.g. ...

2016

A link partitioning approach for real-time control of queue spillbacks on congested arterials

Nikolaos Geroliminis, Mohsen Ramezani Ghalenoei, Nicolas Marie Daniel Bernadette De Lamberterie

In oversaturated urban traffic conditions when traffic demand exceeds capacity at signalised intersections, queues fail to clear during the allocated green times. Once a queue reaches the upstream intersection in an arterial, a queue spillback occurs that ...

Taylor & Francis Ltd2016

On Decision Procedures for Ordered Collections

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

We describe a decision procedure for a logic that supports 1) finite collections of elements (sets or multisets), 2) the cardinality operator, 3) a total order relation on elements, and 4) min and max operators on entire collections. Among the applications ...

2010

Dynamic network loading: a differentiable model that derives link state distributions

Michel Bierlaire, Gunnar Flötteröd, Carolina Osorio Pizano

We present a dynamic network loading model that yields queue length distributions, accounts for spillbacks, and maintains a differentiable mapping from the dynamic demand on the dynamic queue lengths. The approach builds upon an existing stationary queuein ...

2010

Decision Procedures for Algebraic Data Types with Abstractions

Viktor Kuncak, Philippe Paul Henri Suter, Mirco Dotta

We describe a family of decision procedures that extend the decision procedure for quantifier-free constraints on recursive algebraic data types (term algebras) to support recursive abstraction functions. Our abstraction functions are catamorphisms (term a ...

2010

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.

Double-ended queue

Contract-Based Resource Verification for Higher-Order Functions with Memoization

3D dynamic fragmentation with parallel dynamic insertion of cohesive elements

Squid: Type-Safe, Hygienic, and Reusable Quasiquotes

Verifying Resource Bounds of Programs with Lazy Evaluation and Memoization

A link partitioning approach for real-time control of queue spillbacks on congested arterials

Design of Optimal Traffic Flow Control at Intersection with Regard for Queue Length Constraints

On Decision Procedures for Ordered Collections

Agent-Based Routing in Queueing Systems

Dynamic network loading: a differentiable model that derives link state distributions

Decision Procedures for Algebraic Data Types with Abstractions

Graph Chatbot

Chat with Graph Search

Squid: Type-Safe, Hygienic, and Reusable Quasiquotes

3D dynamic fragmentation with parallel dynamic insertion of cohesive elements

Verifying Resource Bounds of Programs with Lazy Evaluation and Memoization

A link partitioning approach for real-time control of queue spillbacks on congested arterials

Design of Optimal Traffic Flow Control at Intersection with Regard for Queue Length Constraints

Agent-Based Routing in Queueing Systems

Dynamic network loading: a differentiable model that derives link state distributions

Decision Procedures for Algebraic Data Types with Abstractions

On Decision Procedures for Ordered Collections