Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Uber App Clone 1.0
TeeChart NET for Xamarin.Forms 2017
JavaScript Framework Shield UI 1.7.33
SentiVeillance SDK Trial 6.0.171442
Instacart Clone 1.0
Dynamic Product Options for Magento 2 2.3.0
AnyChart JS Charts and Dashboards 8.0.0
Key Transformation 8.1131
AnyGantt JS Gantt Charts 8.0.0
Hex Comparison 5.12
SecureBridge 8.1
Hotelline PMS 1.0
TeeBI for RAD Studio Suite 2017
AnyStock Stock and Financial JS Charts 8.0.0
Entrepreneur News Portal 1.0.2
Top Code
Jango Clone Script 1.0
Get Random Record Based on Weight 1.0.0
Travel Portal Script 9.29
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Sine Wave Using JavaFX 1.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
Top Search
Code To Add Url
Photo Add Comment Php
Twitter Update Script Php
Photo Gallery Comment Php
Perl Program To Display Digital Clock
Duplicate Bill Of Electricity Of Best In Mumbai
Dirty Word
Asp Card Game Cardinfo
Gallery Comment
Flat File Php Guestbook
To Rubberband A Line In C Language
Contoh Program Registrasi Dalam Java
Free Prepaid Electricity Meter Generator Download
Program Of C Of Warnock Algorithm
Image Slideshow Html Code
Related Search
Minimum Set Cover Problem Java
Minimum Set Cover Problem
Source Code Of Set Cover Problem C Source Code
Minimum Set Cover
Set Cover Problem
Set Cover Problem In C
Set Cover Np Problem Code
Set Cover Np Problem Codeindex
Set Implementations In Java
Scheduling Problem Java
Josephus Problem Java
Set Protocol For Java
Minimum Cut Program In Java
Problem Java
Set Time In Java Script
 Minimum Set Cover Problem Java 

Code 1-20 of 60   Pages: Go to  1  2  3  Next >>  page  






This function contains the well known greedy algorithm for solving Set Cover problem (ChvdodAtal, 1979), with two small modifications:
* In case of more than one possible choice at a certain step, the biggest set is chosen;
* Once the solution is found, we check the selected sets to find a better cover solution, removing a set if is a subset of the union of the other set.

If you use this code, please cite the article for...



A set of common Java libraries and utilities to extend those already found in apache-commons APIs.



[english] - Jcpp is a libraries set that implement Java's class on C++ language. [spanish] - Jcpp es un conjunto de librerA­as que implementan clases Java sobre el lenguaje c++.



SeQLipse is a set of Eclipse Java plug-ins to browse (not admin!) a SQL database. SeQLipse looks like a browser of the content of the database, providing some views and a perspective. It is intended to be highly configurable.



jcengine is a set of extensible Java classes aimed at creating build-to-order or make-to-order software applications. Code release should be soon ...



DBCache is a tool/framework set that creates java classes from a Database schema, and allows you to start with the logic of your application. It uses a cache to reduce DB overload and facilitates DB access. It'll save you a lot of time.



Javu WingS - Lightweight Java Component Set ---- works with Java 1.1 to 1.6, J#, J++, GCJ ---- Graphics based on hierarchical skin style sheets and GIFs ---- Thread safe ---- Compatible with AWT and Swing, similar API



JavaCommon is a huge set of commons java file in a library, that can be imported into any project. It provides a logging system, persisters, queue systems, utilities for String / IO / ...This library is used by JideoGuard.



Joperties is an extension to the Properties class. It exists to solve a common problem with Properties (all Properties are Strings). Joperties allows you to set and get Java Objects without worrying about the transformation between String/Object.



The Cooker is a GUI Java compiler built to run on any platform. It may evolve into a full set of useful Java utilities.



Free JSF-components to complement the existing implementations component set. See http://java.sun.com/j2ee/javaserverfaces for JSR-127 details.



Java command line parser based on annotations. Aims to minimize the effort needed to set up a Java program from command line arguments.



Hazelcast is a clustering and highly scalable data distribution platform for Java. It is an distributed/partitioned implementation of java.util.{Queue,Map,Set,List} and java.util.concurrent.lock.Lock.



findMIS is an heuristic algorithm for solving Maximum Independent Set problem (MIS).
An independent set of a graph is a subset of vertices in which no two vertices are
adjacent. Given a set of vertices, the maximum independent set...



This contest concerns a very simplified two-dimensional version of the protein folding problem. Given the amino acid sequence of a simplified protein, your job is to determine a final "optimally folded" configuration. Each potential...



This is a simple Java application that will run on Unix/Linux operating systems as a daemon using the Apache Commons Daemon. The purpose of this application is to serve as a template/example of how to set up a Java application as a daemon on...



Polyspace Compiler template sets help at setup phase according to compiler and target
Since Polyspace for R2012a, it is possible to create a new project from a template file.
This tool contains a list of templates that if it fits...



[A , c] = MinVolEllipse(P, tolerance)

Finds the minimum volume enclosing ellipsoid (MVEE) of a set of data points stored in matrix P. The following optimization problem is solved:

minimize log(det(A))
s.t. (P_i -...



This code takes an input of a set of given (x,y) points in the Cartesian coordinates and returns the center and radius of the minimum circle enclosing the points.

This code is based on that of Yazan Ahed, and contains no changes in the...



The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the count of each item to include in a collection so that the total weight is less than or equal...