{"id":20354984,"url":"https://github.com/faif/nfiles-ndisks","last_synced_at":"2026-05-11T14:33:38.720Z","repository":{"id":3541221,"uuid":"4601245","full_name":"faif/nfiles-ndisks","owner":"faif","description":"Calculate the optimum number and size of files that can fit into the hard disk(s) using a genetic algorithm ","archived":false,"fork":false,"pushed_at":"2019-10-22T20:36:00.000Z","size":1555,"stargazers_count":4,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-03-04T17:36:14.350Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/faif.png","metadata":{"files":{"readme":"README","changelog":"changelog","contributing":null,"funding":null,"license":"COPYING","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2012-06-08T19:15:26.000Z","updated_at":"2023-12-24T13:13:43.000Z","dependencies_parsed_at":"2022-09-06T03:32:03.478Z","dependency_job_id":null,"html_url":"https://github.com/faif/nfiles-ndisks","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/faif/nfiles-ndisks","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faif%2Fnfiles-ndisks","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faif%2Fnfiles-ndisks/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faif%2Fnfiles-ndisks/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faif%2Fnfiles-ndisks/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/faif","download_url":"https://codeload.github.com/faif/nfiles-ndisks/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faif%2Fnfiles-ndisks/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32899078,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-10T13:40:02.631Z","status":"online","status_checked_at":"2026-05-11T02:00:05.975Z","response_time":120,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-14T23:10:42.141Z","updated_at":"2026-05-11T14:33:38.696Z","avatar_url":"https://github.com/faif.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"The programs are two examples which use the evolutionary computation \nfield to find an optimum optimization in a constraint-based problem.\n\nMore particularly a genetic algorithm is used in both cases.\n\nThe first problem concerns fitting a random number of files with a \nrandom size each, in a disk of random size.\n\nThe second problem is like the first, but uses a random number of disks \ninstead of just one.\n\nHave fun! \n\nSakis\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffaif%2Fnfiles-ndisks","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffaif%2Fnfiles-ndisks","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffaif%2Fnfiles-ndisks/lists"}