Turn traffic into pipeline and prospects into customers
For account executives and sales engineers looking for a solution to manage their insights and sales data
Docket is an AI-powered sales enablement platform designed to unify go-to-market (GTM) data through its proprietary Sales Knowledge Lake™ and activate it with intelligent AI agents. The platform helps marketing teams increase pipeline generation by 15% by engaging website visitors in human-like conversations and qualifying leads. For sales teams, Docket improves seller efficiency by 33% by providing instant product knowledge, retrieving collateral, and creating personalized documents. Built for GTM teams, Docket integrates with over 100 tools across the revenue tech stack and offers enterprise-grade security with SOC 2 Type II, GDPR, and ISO 27001 compliance. Customers report improved win rates, shorter sales cycles, and dramatically reduced response times. Docket’s scalable, accurate, and fast AI agents deliver reliable answers with confidence scores, empowering teams to close deals faster.
Learn More
Field Sales+ for MS Dynamics 365 and Salesforce
Maximize your sales performance on the go.
Bring Dynamics 365 and Salesforce wherever you go with Resco’s solution. With powerful offline features and reliable data syncing, your team can access CRM data on mobile devices anytime, anywhere. This saves time, cuts errors, and speeds up customer visits.
X-GAT (XML-based Genetic Algorithm Toolkit) is a Java framework to optimize problems with Genetic Algorithms (GAs). Differently from other frameworks, X-GAT contains ready-to-use GAs implementations and new features can be easily added.
Mainly include the codes of genetic algorithm, interative genetic algorithm, that are written in Java Applcations also included such as function optimization, simple fashion design optimization, face optimization and so on
superseded by SgpDec http://sgpdec.sf.net Java implementation of the holonomy algorithm for the algebraic hierarchical decomposition of finite state automata.
Inventory and Order Management Software for Multichannel Sellers
Avoid stockouts, overselling, and losing control as your business grows.
We are the most powerful inventory and order management platform for Amazon, Walmart, and multichannel product sellers. Centralize orders, product information, and fulfillment operations to run more efficiently, sell more products, and stay compliant with marketplace requirements so you can grow profitably.
BorderFlow implements a general-purpose graph clustering algorithm. It maximizes the inner to outer flow ratio from the border of each cluster to the rest of the graph.
CEGA is a highly extendable layout plugin for Cytoscape based on an Evolutionary Algorithm. In contrast to other layout algorithms, CEGA lets users decide which features are important for the visualization of their graphs.
Optex Analyzer is a software to analyze and compare algorithms to solve approximately optimization problems. It has a GUI that allows select a set of input files containing raw algorithm results. The analysis is shown with tables and charts.
weka outlier is an implementation of outlier detection algorithms for WEKA.
CODB (Class Outliers: Distance-Based) Algorithm is the first algorithm developed using WEKA framework.
The full-stack observability platform that protects your dataLayer, tags and conversion data
Stop losing revenue to bad data today. and protect your marketing data with Code-Cube.io.
Code-Cube.io detects issues instantly, alerts you in real time and helps you resolve them fast.
No manual QA. No unreliable data. Just data you can trust and act on.
Maui is a multi-purpose automatic topic indexing algorithm. Given a document, Maui automatically identifies its topics. Depending on the task topics are tags, keywords, keyphrases, vocabulary terms, descriptors or Wikipedia titles.
The implementation of Bee Hive @ Work algorithm that simulates the foraging behavior of honey bees in nature. The aim is to provide an extensible framework that can be used by researchers to simply create new applications of this algorithm.
GAAF is a tool for analyzing Genetic Algorithms (GA for short). It allows to check the behavior of a particular GA resolving a particular problem so one can get empirical information to decide which GA best fits problem's conditions.
Java package to study a clustering model described in the paper \"Novel Clustering Algorithm Based Upon Games on Evolving Network\" by Q. Li, Z. Chen, Y. He and J-P. Jiang (in arxiv: http://arxiv.org/pdf/0812.5064v1), generalizations and similar issues.
Java API for implementing any kind of Genetic Algorithm and Genetic Programming applications quickly and easily. Contains a wide range of ready-to-use GA and GP algorithms and operators to be plugged-in or extended. Includes Tutorials and Examples.
ECSKernel is a multiagent coordination algorithm testbed, built on the RoboCupRescue disaster simulation platform. It is easily configurable and can be used with user-generated scenarios.
TBLTools is a set of GATE processing resources that implements the Fast Transformation Based Learning Algorithm. You can train it to learn rules for NLP tasks such as Named Entity Recognition and Shallow parsing.
TACS (Trust Ant Colony System) is a Trust model for P2P, Ad-hoc and Wireless Sensor networks (also valid for multi-agent systems) based on the bio-inspired algorithm ACS (Ant Colony System).
A discretization algorithm based on the Minimum Description Length. Implemented as a filter according to the standards and interfaces of WEKA, the Java API for Machine Learning. More Info: http://bruno-wp.blogspot.com/search/label/Software
The Decision Tree Learning algorithm ID3 extended with pre-pruning for WEKA, the free open-source Java API for Machine Learning. It achieves better accuracy than WEKA's ID3, which lacks pre-pruning.Info: http://bruno-wp.blogspot.com/search/label/Softwar
Proposed is an algorithm
that uses computer vision, combined with a modified Rubine classifier, to allow
arbitrary N-sided polygons as accepted sketches in real-time.
Random Forest classification implementation in Java based on Breiman's algorithm (2001). It assumes the data is in the form [ X_1, X_2, . . ., X_M, Y ] where Y \in {0, 1, . . ., C}. The user must define M, C, and m initially.