Search Results for "combinatorial"
Sort By:
Showing 60 open source projects for "combinatorial"
View related business solutions-
BrightGauge, a ConnectWise solution, was started in 2011 to fill a missing need in the small-to-medium IT Services industry: a better way to manage data and provide the value of work to clients. BrightGauge Software allows you to display all of your important business metrics in one place through the use of gauges, dashboards, and client reports. Used by more than 1,800 companies worldwide, BrightGauge integrates with popular business solutions on the market, like ConnectWise, Continuum, Webroot, QuickBooks, Datto, IT Glue, Zendesk, Harvest, Smileback, and so many more. Dig deeper into your data by adding, subtracting, multiplying, and dividing one metric against another. BrightGauge automatically computes these formulas for you. Want to show your prospects how quick you are to respond to tickets? Show off your data with embeddable gauges on public sites.
-
Cut through the noise and end information overload with Guru, an all-in-one wiki, intranet, and knowledge base that serves as your company's single source of truth.
-
1
AlphaZero.jl
A generic, simple and fast implementation of Deepmind's AlphaZero
Beyond its much publicized success in attaining superhuman level at games such as Chess and Go, DeepMind's AlphaZero algorithm illustrates a more general methodology of combining learning and search to explore large combinatorial spaces effectively. We believe that this methodology can have exciting applications in many different research areas. Because AlphaZero is resource-hungry, successful open-source implementations (such as Leela Zero) are written in low-level languages (such as C... -
2
CGAL
The Computational Geometry Algorithms Library
CGAL or the Computational Geometry Algorithms Library is a C++ library that gives you easy access to a myriad of efficient and reliable geometric algorithms. These algorithms are useful in a wide range of applications, including computer aided design, robotics, molecular biology, medical imaging, geographic information systems and more. CGAL features a great range of data structures and algorithms, including Voronoi diagrams, cell complexes and polyhedra, triangulations, arrangements of... -
3
InferOpt.jl
Combinatorial optimization layers for machine learning pipelines
InferOpt.jl is a toolbox for using combinatorial optimization algorithms within machine learning pipelines. It allows you to create differentiable layers from optimization oracles that do not have meaningful derivatives. Typical examples include mixed integer linear programs or graph algorithms. -
4
OR-Tools - Google Optimization Tools
Google's software suite for combinatorial optimization
Google Optimization Tools, also known as OR-Tools is an open-source, fast and portable software suite for solving combinatorial optimization problems. These encompass problems in vehicle routing, flows, integer and linear programming, and constraint programming. This suite contains a number of solvers, namely: a constraint programming solver; a linear programming solver; wrappers for commercial solvers (like Gurobi or CPLEX) and other open source solvers (SCIP, GLPK, etc.); among others... -
Out-of-the-box scripts. Around-the-clock monitoring. Unmatched automation capabilities. Start doing more with less and exceed service delivery expectations.
-
5
ECLiPSe CLP
ECLiPSe Constraint Logic Programming System
The ECLiPSe Constraint Logic Programming System is designed for solving combinatorial optimization problems, for the development of new constraint solver technology and their hybrids, and for the teaching of modelling, solving and search techniques. -
6
Combinatorial therapies have been recently proposed for improving anticancer treatment efficacy. SynergyFinder R package is a software tool to analyze pre-clinical drug combination datasets developed in our group. To facilitate the use of the R package for the drug discovery community, we also provide a web server called SynergyFinder PLus at http://synergyfinder.org/ that provides a user-friendly interface to enable a more flexible and versatile analysis of drug combination data. Sister...
-
7
MzDOCK - Multiple Ligand Docking Tool
MzDOCK is A Virtual Screening Tool For Drug Discovery Research
- Molecular Docking Virtual Screening Tool To Aid In Drug Discovery Research. - Developed with Synchronized functioning of Python and Batch scripts - Compatible on Windows - Accepted on Journal of Computational Chemistry - DOI: 10.1002/jcc.27390 -Integerated With Pymol-open-source for visualizing interaction (PSE file) generated from MzDOCK - Combinatorial Molecule Generation - Integrated with Molecule Drawing Tool - JSME Editor - If you are facing any issues or for queries . Contact us... -
8
JaCoP is a Java Constraint Programming solver. It provides a significant number of (global) constraints to facilitate efficient modeling of combinatorial problems, as well as modular design of search. Documentation is available at project Web site. Please, note that the sources from version 4.0 are only available at GitHub.
-
9
nars2000
NARS2000: An Experimental APL Interpreter
APL is an arrary-oriented language initially conceived in the 1960s by Kenneth E. Iverson, IBM Fellow and 1979 ACM Turing Award recipient. It is ideally suited to computer programming because it subsumes the tedious aspects of the job allowing the programmer to concentrate on the heart of the project. NARS2000 is a Free Open Source implementation of APL. For more details on this project, visit the NARS2000.org website. -
As your users rely more and more on Cloud and Internet-based technologies, reliable internet connectivity becomes more and more important to your business. With Bigleaf’s proven SD-WAN architecture, groundbreaking AI, and DDoS attack mitigation, you can finally deliver the reliable internet connectivity your business needs without the limitations of traditional networking platforms. Bigleaf’s Cloud Access Network and plug-and-play router allow for limitless control to and from anywhere your traffic needs to go. Bigleaf’s self-driving AI automatically identifies and adapts to any changing circuit conditions and traffic needs—addressing issues before they impact your users. Bigleaf puts you in the driver’s seat of every complaint and support call with full-path traffic and network performance data, delivered as actionable insights, reports, and alerts.
-
10
Linearizer
Small application that helps linearizing (cos x)^n and (sin x)^n
... * Simplification of Fractions *Operations on Fractions *Combinatorial calculations *Linearization of (cos x)^n and (sin x)^n -
11
Combinatorial Game Suite
A computer algebra system for research in combinatorial game theory.
STARTING WITH VERSION 2.0, CGSUITE HAS MOVED TO GITHUB. The latest version can be found at the CGSuite homepage: https://www.cgsuite.org/ This page is preserved for archival purposes only and is no longer being maintained. -
12
Jack LIRE (Linked Record)
Quantum universal object system with referencing and genetics
Jack LIRE (Linked Record) is a quantum database-backed life-long text record diary with referencing (linking) between records, and a data library for life-long keeping of files such as documents, photographs, music and more. The diary records are fully searchable. Files can be mentioned in diary records to preserve memories, document knowledge and ideas, and more. Massive numbers of diary records and files can be permanently kept. A database located on one computer can be accessed from... -
13
moosha-ai
An intelligent virtual assistant (IVA) or intelligent personal assista
An intelligent virtual assistant (IVA) or intelligent personal assistant (IPA) is a software agent that can perform tasks or services for an individual based on commands or questions. Sometimes the term "chatbot" is used to refer to virtual assistants generally or specifically accessed by online chat. In some cases, online chat programs are exclusively for entertainment purposes. Some virtual assistants are able to interpret human speech and respond via synthesized voices. Users can ask... -
14
CompleXChange
differential analysis of combinatorial protein complexes
The increasing wealth of transcriptomic data and current computational tools enable to infer how protein interactomes and complexomes may be assembled in specific samples. With CompleXChange this information can be exploited to conduct differential analyses of the dynamic protein complexome in a quantitative manner. The corresponding publication can be found on https://doi.org/10.1186/s12859-019-2852-z. -
15
DACO-algorithm
A novel transcription factor complex prediction algorithm.
... interaction networks and domain-domain interaction networks with the cluster-quality metric cohesiveness. The metric is locally maximized on the holistic level of protein interactions while sophisticated connectivity constraints on the domain level are utilized to account for the exclusive and thus inherently combinatorial nature of the interactions within such assemblies. The original publication can be found on http://bioinformatics.oxfordjournals.org/content/30/17/i415 . -
16
CitLab
Combinatorial Interaction Testing Laboratory
Although the research community around combinatorial interaction testing has been very active for several years, it has failed to find common solutions on some issues. First of all, there is not a common abstract nor concrete language to express combinatorial problems. Combinatorial testing generator tools are strongly decoupled making difficult their interoperability and the exchange of models and data. In this project, we propose an abstract and concrete specific language for combinatorial... -
17
... clustered within different chromatin states. These chromatin-state-specific regulatory modules were found to have significant influence on gene expression. Furthermore, we observed that the identified regulatory modules and chromatin states may jointly determine the motif preference for specific class of proteins. Thus, our results reveal a relation between chromatin states and combinatorial binding of proteins in the complex transcriptional regulatory process.
-
18
OptFrame is a framework for efficient implementation of metaheuristics and optimization methods. It has already been used in some real combinatorial problems and applied to Operations Research. Since November 2017, project has been moved to GitHub (new releases will also be included here in SourceForge, but Git mainline is no longer supported here). For more information, visit: https://github.com/OptFrame/optframe
-
19
MoCObench
Benchmark instances for multiobjective combinatorial optimization
Benchmark instances for multiobjective combinatorial optimization -
20
Plant Metabolite Annotation Toolbox (PlantMAT) is a computational tool combining library search and combinatorial enumeration to facilitate the structural identification of plant specialized metabolites, e.g., saponins and flavonoid glycosides.
-
21
-
22
Grammar based Combinatorial Solver
Solver with Applications in Computer Network Systems Design
The solver performs an exhaustive search on the space defined using simple formal language grammar constructs to identify solutions that meet the objective and constraints. It can be used to easily define complex discrete multi-dimensional combinatorial problems that are otherwise difficult to model using Mixed Integer Linear Programming solvers. The solver does not make any assumptions on continuity of the search space. The solver is implemented in PHP. A GoJS based visualization is provided... -
23
The complexity of cellular networks is an outstanding challenge for documentation, visualisation and mathematical modelling. In this project, we develop a new way to describe these networks that minimises the combinatorial complexity and allows an automatic visualisation and export of mathematical (ODE/rulebased) models.
-
24
OPTSYS Framework Optimization Suite
Software Framework for Combinatorial Optimization using Metaheuristics
Die OPTSYS Framework Optimization Suite ist nicht nur eine Optimierungssoftware, sondern darüber hinaus ein umfangreiches Softwareframework für die kombinatorische Optimierung mit einem besonderen Fokus auf heuristische Lösungsmethoden. Das Framework versteht sich als Expertensystem zur Abbildung von kombinatorischen Optimierungsproblemen und für die Umsetzung, Anwendung und Evaluierung von zugehörigen Lösungsmethoden. Aufgrund der vielfältigen Funktionen zur Evaluation eignet es sich... -
25
... present a new algorithm for this problem based on the metaheuristic called Greedy Randomized Adaptive Search Procedure (GRASP) that has been routinely used to find solutions for combinatorial optimization problems. In essence, we implemented an iterative process in which each iteration receives a feasible solution whose neighborhood is investigated. Our analysis shows that we outperform any other approach by significant margin.