Search Results for "combinatorial" - Page 2
Sort By:
Showing 60 open source projects for "combinatorial"
View related business solutions-
Our robust pre-built connectors and our no-code, drag-and-drop interface makes it easy and fast to automatically sync vendors, invoices, and invoice payment data between Tipalti and your ERP or accounting software.
-
Google Cloud’s AI-powered APIs help you translate documents, websites, apps, audio files, videos, and more at scale with best-in-class quality and enterprise-grade control and security.
-
1
HH-Evolver
A framework for domain-specific, hyper-heuristic evolution
HH-Evolver is a framework for domain-specific, hyper-heuristic evolution. HH-Evolver automates the design of domain-specific heuristics for planning domains. Hyper-heuristics generated by our tool can then be used with combinatorial search algorithms such as A* and IDA* for solving problems of the given domain. -
2
CCH
A genetics tool that identifies genomic regions of shared ancestry
Combinatorial Conflicting Homozygosity (CCH) uses dense Single Nucleotide Polymorphism (SNP) genotypes to identify regions of the genome inherited from a common ancestor among any or all subsets of a group. Analysis is rapid and can identify loci containing genes for dominant traits. CCH is robust to the presence of phenocopies and can detect undisclosed shared common ancestry. The associated publication regarding CCH may be accessed here: http://www.biomedcentral.com/1471-2164/16/163 If you... -
3
Combinatorial Auction Test Suite
Test data for combinatorial auction winner determination
The Combinatorial Auction Test Suite is a generator of combinatorial auction instances for the testing of CA algorithms. It features five distributions of instances from realistic, economically motivated domains, as well as a collection of artificial distributions that have been used in the literature. Since the release of CATS 1.0 in 2000, it has become a standard benchmark for the evaluation and comparison of CA algorithms. -
4
JConstraints
Java Framework to implement solutions to solve constraints problems
JConstraints is a Java Framework that enables implementations of advanced solutions for combinatorial problems as constraints satisfaction problems. The architecture was built thinking in the constraints satisfaction paradigm. The Framework is easy to use. Therefore, with few interfaces implementations you can already run advanced combinatory solutions. Just to name a few algorithms, the Framework can solve any constraints problems using: - Regular Backtracking; - A variety of Backjumping... -
Venn is a secure workspace for remote work that isolates and protects work from any personal use on the same computer. Work lives in a secure local enclave that is company controlled, where all data is encrypted and access is managed. Within the enclave – visually indicated by the Blue Border around these applications – business activity is walled off from anything that happens on the personal side. As a result, work and personal uses can now safely coexist on the same computer.
-
5
caplib
Correct, translate and analyze combinatorial library sequencing data
Originally developped to handle PacBio CCS data for an AAV capsid library. This program will extract, correct, translate and analyze the sequencng data, starting from the CCS fastq file. -
6
Visualization and clustering analysis of X-Ray diffraction data from combinatorial thin film libraries.
-
7
Java Combinatorial Optimization Platform is used to solve combinatorial problems using common interface, providing means to easily add new algorithms and problems and to benchmark them.
-
8
Bin Packing with Genectic Algorithm
Bin Packing problem solved using Genectic Algorithm
This project contains a solution for a Bin Packing problem solved using Genectic Algorithms. The code in the project was created as a solution for a problem in a combinatorial optimization class at the Univeridade Federal do Rio Grande do Sul (UFRGS - Brasil) in 2007. -
9
RaTrav
mean first passage times and node occupancies calculations
RaTrav tool was designed to support computational biology studies where mean first-passage times (MFPTs) between initial and single or multiple final states in network-like systems are used. The tool approves arbitrary networks (graphs) where a dynamics of the Markovian type takes place. Two methods are made available for which their efficiency is strongly dependent on the topology of the defined network: the combinatorial Hill technique and the Monte Carlo simulation method. References: M... -
From improving customer experience through seamless sign-on to making MFA as easy as a click of a button – your login box must find the right balance between user convenience, privacy and security.
-
10
Fuegito
Lightweight C++ combinatorial-game development framework.
Fuegito: A simple framework for game-playing, with an application to the game of Clobber. Inspired by Fuego. The aim of this research project is to develop a smaller, much simpler but compatible framework to Fuego, which can be easily used for teaching game programming in undergraduate and graduate courses, as well as for implementing new games. -
11
FJSP Software
A Software for Flexible Job Shop Scheduling
Flexible job shop scheduling problem (FJSP) is very important in many fields such as production management, resource allocation and combinatorial optimization. In the real manufacturing systems, each operation could be processed on more than one machine and each machine can also process several operations. This feature is known as flexibility. You can define your problem in this software and get an optimal solution as a Gantt Chart. This software is based on my M.Sc. thesis of Shahed university... -
12
Water Retention on Magic Squares Solver
Water Retention on Magic Squares with Constraint-Based Local Search
A Constraint-Based Local Search solver for the Water Retention on Magic Squares-problem. The problem is a very hard combinatorial optimisation problem, invented by Craig Knecht. More can be read about it at: http://en.wikipedia.org/wiki/Water_retention_on_mathematical_surfaces Craig's website for the problem: http://www.knechtmagicsquare.paulscomputing.com/ The solver is mainly based on the theory and ideas from my bachelor thesis, which I wrote at Uppsala University, Sweden, for the Astra... -
13
Asteroid
A CBLS Engine in SCALA, NOW part of OscaR
Asteroid has been merged with Scampi, to give rise to OScar. Follow us on https://bitbucket.org/oscarlib/oscar/wiki/Home Asteroid offers a powerful framework for developing constraint-based local search solution to combinatorial problems. This technique provides good scalability to real-world problems. It includes a library of standard constraints and invariants to declaratively define the problem you want to solve, and it also provides powerful search mechanisms. -
14
MARC Library ( SobekCM )
Another C# MARC Record implementation
This is a C# library which contains classes for working in memory with MARC records ( http://www.loc.gov/marc/ ). This allows records to be read from MarcXML and Marc21 formats. Once in memory any field or subfield can be edited, added, or deleted. Then the record can be queried or saved again in either a MarcXML or Marc21 file format. In addition, version 1.1 includes Z39.50 capability and auto-translation from the most common MARC8 characters into Unicode. -
15
ORganic Virtual Library (ORVIL) Program
ORganic VIrtual Library (ORVIL)
ORganic VIrtual Library (ORVIL) –A COMBINATORIAL LIBRARY CONSTRUCTION BASED ON ORGANIC CONSTITUENTS AND WITHOUT SCAFFOLD HOPPING Abstract Rapid construction of virtual combinatorial library is a prerequisite for in silico library enumeration and design. ORganic VIrtual Library (ORVIL) is a perl program to generate a combinatorial library using most frequently observed 200 organic substituents. It is designed to explore the organic chemical space in the given query structure without... -
16
Intelligent Water Drops Algorithm
Solving optimization problems by the Intelligent Water Drops algorithm
This project deals with the Intelligent Water Drops algorithm or the IWD algorithm. The IWD algorithm is a population & nature-inspired combinatorial optimization algorithm. It tries to imitate the behavior that natural water drops conduct in river beds where they create complex paths that seem optimistic considering the environment, obstacles, and the surrounding terrain. One way to use the IWD algorithm is to map our optimization problem into a graph over which Intelligent Water Drops (IWDs... -
17
A Generalized Combinatorial Approach for Detecting Gene-by-Gene and Gene-by-Environment Interactions
-
18
-
19
PreFail is a programmable failure-injection framework. It enables testers to (1) inject multiple failures to the target system and (2) write a wide range of pruning policies to reduce the combinatorial explosion of multiple failures.
-
20
TestTwo is a test case generator and an evolution of James Bach's Allpairs. It was necessary to have a solid Matlab interface, so Ruby is used to allow easier usage of the external Matlab/C libraries.
-
21
The aim of the PL-PSF project is to create a generic domain-independent combinatorial problem solver. It uses a petri-nets based model to represent the problems and problem decomposition/abstraction with graph topology analysis to solve them.
-
22
Shears is a C# library for list processing, combinatorial problems, and functional programming. It is intended to be useful for everyday coding, with an emphasis on producing brief, readable code. It's also lots of fun!
-
23
This project presents another possible solution to the state of kingdom problem and makes use of function sorting concept to minimize the penalty levied on the jobs thus, present a sequence of jobs to be taken up to get the least penalty.
-
24
Mircrogrid market is a proof-of-concept implementation of a combinatorial heat and power double auction exchange. With this platform energy consumers and producers can buy or sell heat and power resources on demand for certain times of the day.
-
25
Genijatorics is a library providing solutions to enumerative combinatorial problems. The most prominent example of its use is for generating events in specified date range from CRON-like descriptions. It also serves for educational purposes.