Code compaction by evolutionary algorithm
CA 2322138 A1 · Owner: Schaffer, J. David · Inventors: Schaffer, J. David; Mathias, Keith E.; Eshelman, Larry J.
Overview
Its claims, description and drawings are in the Canadian Patents Database.
Open the CIPO recordAbstract From the Canadian patent
A code compaction based on macro substitutions is presented wherein the choice of possible macro substitutions is guided by an evolutionary algorithm process. In a preferred embodiment, a random population of sets of macro substitutions are generated and a compaction effectiveness is evaluated for each set. This random population is partitioned into pairs of "parents" and , each pair of parents produce a pair of "offspring". The effectiveness of the compaction provided by each of the offspring is evaluated and a "survival of , the fittest" algorithm is applied to identify the individuals that have the best compaction effectiveness. These preferred individuals are partitioned into …
Read the whole patent
Listed from its CIPO record in Patent Yard's archive of Canadian patents past their term. Its claims, description and drawings are in the CIPO record and on Google Patents, and the Claude kit works from them.
Why it's free to use
- Filed December 13, 1999. No grant is recorded for it in Canada; had it been granted, its 20-year term would have ended December 13, 2019.
- A certificate of supplementary protection adds at most two years for a drug, so even that would have ended by December 13, 2021.
- We check Canadian rights only. A patent in its family in another country could still be in force: check its family on Google Patents.
Timeline
Timeline From CIPO dates
Sources & verification
Official CIPO records
Everything on this page comes from the CIPO record linked above. Contains information licensed under the Open Government Licence – Canada.