Three space-economical algorithms for calculating minimum-redundancy prefix codes

Título:

Three space-economical algorithms for calculating minimum-redundancy prefix codes

Autor:

Artur Alves Pessoa

Ano:

2001

DOI:

10.1109/18.945242

Revista:

IEEE Transactions on Information Theory

ISSN:

00189448

Tags:

Data Compression

space economical

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing

A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints

Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty

LEVEL OF REPAIR ANALYSIS INCLUDING FAILURE ANALYSIS AND OPTIMAL LOCATION OF MAINTENANCE FACILITIES AND RESOURCES

Solving Bin Packing Problems Using VRPSolver Models

A generic exact solver for vehicle routing and related problems

An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems

Iterated local search for single machine total weighted tardiness batch scheduling

An exact approach for the r-interdiction covering problem with fortification

An exact approach for the r-interdiction median problem with fortification