| RLE | RLC circuit | RLM aircraft by manufacturer |
| RLM aircraft designation systemThe RLM aircraft designation system was a an attempt by a the aviation bureaucracy of the Third Reich to standardize and produce a identifier for each aircraft type produced in Germany. It was in use from 1933 to 1945 though many pre-1933 aircraft were in | RLSRLS is an acronym that can refer to: Robert Louis Stevenson: A novelist, poet, and travel writer. Recursive Least Squares: A mathematical optimization technique. Restless Leg Syndrome: A sleep disorder. Reversing language shift: A model of language revita | RlabRlab refers to an interactive, interpreted numerical computation program and its core programming language, written by Ian Searle. Rlab (the language) is very high level and intended to provide fast prototyping and program development, as well as easy dat |
| RloginIn computing, rlogin is a Unix software utility that allows users to log in on another host via a network, communicating via TCP port 513. It was first distributed as part of the 4. 2BSD release. rlogin is also the name of the application layer protocol u | RL-10 (rocket engine)The RL-10 was America's first liguid hydrogen fueled rocket engine. Six RL-10 engines were used in the S-IV second stage of the Saturn I rocket. Two RL-10 engines are used in the Centaur upper stages of Atlas and Titan rockets. There were proposals to use | RL BurnsideRL Burnside is a Blues musician from from near Holly Springs, Mississippi. He was born in Lafayette County in the hills of North Mississippi and has lived most of his life in adjoining Marshall County, where Holly Springs is located. Burnside was inspired |
| Rlim-ShaikorthRlim-Shaikorth is a Great Old One an creation of Clark Ashton Smith. One of his avatars is known as the White Worm, which appeared in Hyperborea. | RLThis article is about the complexity class; for the acronym used on the Internet, see real life. In computational complexity theory, RL is the complexity class of problems solvable in logarithmithic space with probabilistic Turing machines that never acce | RLPIn computational complexity theory, RLP is the complexity class of problems solvable in logarithmithic space and polynomial time with probabilistic Turing machines that never accept incorrectly but are allowed to reject incorrectly less than 1/3 of the ti |
