IEEE

Edges metric constrained PEG algorithm for designing LDPC codes

Abstract: The progressive edge-growth (PEG) algorithm is a general method to construct short low-density parity-check (LDPC) codes and it is a greedy method to place each edge with large girths. In ...
Wired

A New Algorithm Makes It Faster to Find the Shortest Paths

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...
IEEE

Hybrid Adaptive Greedy Algorithm Addressing the Multi-Robot Path Planning Problem

Abstract: In the past few years, path planning and scheduling became a high-impact research topic due to their real-world applications such as transportation, manufacturing and robotics. This paper ...
Frontiers

Dynamic penalty-based dispatching decision-making for improved emergency response in urban environments: a heuristic approach

1 Department of Civil Engineering and Engineering Mechanics, Columbia University, New York, NY, United States 2 Sonny Astani Department of Civil and Environmental Engineering, University of Southern ...