Search Results for "ns2 code with algorithm"

The Boehm-Demers-Weiser conservative garbage collector can be used as a garbage collecting replacement for C malloc or C++ new. It allows you to allocate memory basically as you normally would, without explicitly deallocating memory that is no longer useful. The collector automatically recycles memory when it determines that it can no longer be otherwise accessed. The collector is also used by a number of programming language implementations that either use C as intermediate code, want to...

Serpent_in_CBC_mode_for_microcontrollers is an open-source code that enables you to easily integrate the Serpent encryption algorithm in CBC mode to your project. Based on the work of https://github.com/peterferrie/serpent GitHub Page: https://github.com/Northstrix/Serpent_in_CBC_mode_for_microcontrollers

Simple, fast implementation of LZW (Lempel–Ziv–Welch) data compression algorithm in C. - Console encoder/decoder tools - OS independent - Could be used in embedded projects - Works with raw code-stream LZW features: - Hardcoded dictionary size - Variable code size - Code search is performed by hash table and embedded in dictionary linked lists (encoder) - No dynamic memory allocation

FiwixOS 3 is a Fiwix distribution, an operating system made from a software collection that is based upon the Fiwix kernel. It basically comprises a Fiwix kernel, GNU tools, libraries and additional software. All the included software is free and open-source software made available both as compiled binaries and in source code form, which allows modifications to the original software. FiwixOS 3 uses the Newlib v3.1.0 as its C standard library, and the Ext2 as its primary file...

PREESM provides a complete framework for fast prototyping. It generates a simulation and an optimized multiprocessor code from graph descriptions of algorithm and architecture. Please visit the project homepage at http://preesm.sourceforge.net.

...For the remaining blocks of the cover file till the end of the code is reached, an adjacent blocknr. represents the same bit as the previous one and a non-adjacent blocknr. (a block will be skipped) a negated previous bit. It's necessary to use a partition with enough adjacent free blocks (code length + holes for fragmentation) within a blockgroup, for this algorithm to work correctly.

...The main problem with LZO is that it is absolutely not human readable. People have done crazy stuff to get LZO to run in their language. Usually it implies inline assembly or trying to execute data which actually contains machine code. This is sick. Whoever is responsible for this sorry situation ought to be ashamed. So I'm going to deobfuscate LZO and provide a ISC implementation of this algorithm in Python and C. In addition, I will provide a textual description of the algorithm so that it can be easily ported to any programming language. I expect a severe performance degradation, but I leave optimizing for speed to other people.

...You can upload a better modified version and improove this article by contacting me. With some pin changes you can port this code to other arduino boards.