Kinetic priority queue

A Kinetic Priority Queue is an abstract kinetic data structure. It is a variant of a priority queue designed to maintain the maximum (or minimum…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

In article is presented the Creation Hypothesis without Big-Bang and without any other coherent energy-level . An extend…

2010

We restrict purely kinetic k-essence. Assuming that the equation of state is a power law of the kinetic energy, i.e. w = w0Xα, we…

2009

A new dual-wavelength dual-indicator negative catalytic kinetic spectrophoto-metric method for determination of trace chromium…

2004

We investigate the regime where instability in deterministic fluid flow models for congestion control analysis in data networks…

2004

Priority queues are essential data structures found in numerous applications such as discrete event simulations, where a priority…

2003

KEY BENEFIT: Updated for Java 6.0, this coherent introduction to data structures allows readers to develop high-quality software…

1999

ion Automaton ALU Manager Process Figure 24: Kernel Level model with Abstraction Automaton 54 Abstraction Automata Signature…

1995

It is well recognised that artifacts can occur due to changing activity during SPECT acquisition in tracer kinetic studies…

1991

In this segment of a larger multidisciplinary study of the movement and fate of creosote derived compounds in a sand-and-gravel…

1990