From owner-cvs-all@FreeBSD.ORG Sat Mar 20 19:36:43 2010 Return-Path: Delivered-To: cvs-all@FreeBSD.org Received: from mx1.freebsd.org (mx1.freebsd.org [IPv6:2001:4f8:fff6::34]) by hub.freebsd.org (Postfix) with ESMTP id A191A106564A; Sat, 20 Mar 2010 19:36:43 +0000 (UTC) (envelope-from miwi@FreeBSD.org) Received: from repoman.freebsd.org (repoman.freebsd.org [IPv6:2001:4f8:fff6::29]) by mx1.freebsd.org (Postfix) with ESMTP id 90C8E8FC08; Sat, 20 Mar 2010 19:36:43 +0000 (UTC) Received: from repoman.freebsd.org (localhost [127.0.0.1]) by repoman.freebsd.org (8.14.3/8.14.3) with ESMTP id o2KJah6J062962; Sat, 20 Mar 2010 19:36:43 GMT (envelope-from miwi@repoman.freebsd.org) Received: (from miwi@localhost) by repoman.freebsd.org (8.14.3/8.14.3/Submit) id o2KJahK8062961; Sat, 20 Mar 2010 19:36:43 GMT (envelope-from miwi) Message-Id: <201003201936.o2KJahK8062961@repoman.freebsd.org> From: Martin Wilke Date: Sat, 20 Mar 2010 19:36:43 +0000 (UTC) To: ports-committers@FreeBSD.org, cvs-ports@FreeBSD.org, cvs-all@FreeBSD.org X-FreeBSD-CVS-Branch: HEAD Cc: Subject: cvs commit: ports/sysutils Makefile ports/sysutils/gaffitter Makefile distinfo pkg-descr ports/sysutils/gaffitter/files gaffitter.1 X-BeenThere: cvs-all@freebsd.org X-Mailman-Version: 2.1.5 Precedence: list List-Id: **OBSOLETE** CVS commit messages for the entire tree List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sat, 20 Mar 2010 19:36:43 -0000 miwi 2010-03-20 19:36:43 UTC FreeBSD ports repository Modified files: sysutils Makefile Added files: sysutils/gaffitter Makefile distinfo pkg-descr sysutils/gaffitter/files gaffitter.1 Log: Genetic Algorithm File Fitter, GAFFitter for short, is a tool based on a genetic algorithm (GA) that tries to fit a collection of items into as few as possible volumes of a specific size. For example, the items might be files/directories and the volumes might be CDs or DVDs. The task of arranging items in such manner that the number of required bins is minimized is called Bin Packing, a NP-hard combinatorial problem for which no deterministic polynomial-time algorithm is known. Using heuristics, such as GAs, it is usually possible to approximate -- and often reach -- the best solution for the problem within a reasonable time. WWW: http://gaffitter.sourceforge.net PR: ports/144725 Submitted by: Charlie Kester Revision Changes Path 1.1171 +1 -0 ports/sysutils/Makefile 1.1 +31 -0 ports/sysutils/gaffitter/Makefile (new) 1.1 +3 -0 ports/sysutils/gaffitter/distinfo (new) 1.1 +190 -0 ports/sysutils/gaffitter/files/gaffitter.1 (new) 1.1 +15 -0 ports/sysutils/gaffitter/pkg-descr (new)