Search Results for "parallel search"

mctx is a Monte Carlo Tree Search (MCTS) library developed by Google DeepMind for reinforcement learning research. It enables efficient and flexible implementation of MCTS algorithms, including those used in AlphaZero and MuZero.

security-audit is a coding-agent skill for running structured security audits on software repositories. It organizes the audit into multiple phases so the agent does not simply search randomly for vulnerabilities. The workflow begins with reconnaissance, then moves into parallel hunting across attack classes such as injection, access control, business logic, cryptography, feature abuse, and chained attacks. Findings are then challenged through separate validation agents to reduce false positives. The skill produces human-readable reports, detailed finding traces, structured JSON output, and independent verification against the actual source code. ...

ECF is a framework intended for application of any type of evolutionary computation (GA/GP, DE, Clonalg, ES, PSO, ABC, GAn, local search...). It offers simplicity for the end-user (parameterless usage, tutorial) and customization for experienced EC practicioners.

...In this framework, problems are modeled as a graph of operations where nodes represent reasoning steps and edges represent dependencies between them. The framework executes these operations using a large language model as the reasoning engine while evaluating intermediate results to guide the search process. This approach enables models to explore multiple reasoning strategies in parallel and choose the most promising solutions during problem solving.

...Unlike traditional two-stage systems that separately train an acoustic model and a vocoder, VITS trains an end-to-end model that maps text directly to waveform using a conditional variational autoencoder combined with normalizing flows and adversarial training. This architecture enables parallel generation (fast inference) while achieving speech quality that rivals or surpasses many two-stage systems. The repository provides training and inference pipelines for common datasets such as LJ Speech (single-speaker) and VCTK (multi-speaker), including filelists, configs, and preprocessing scripts. It also includes monotonic alignment search code and g2p preprocessing, which are crucial components for aligning text and speech in an end-to-end setup.

popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known network flow and other graph algorithms. ...

MapPSO is a tool for Ontology Alignment, which uses Discrete Particle Swarm Optimisation. A particle swarm is used to search for the optimal alignment. The algorithm is massively parallel and adapts naturally on parallel architectures.

Platform for parallel computation in the Amazon cloud, including machine learning ensembles written in R for computational biology and other areas of scientific research. Home to MR-Tandem, a hadoop-enabled fork of X!Tandem peptide search engine.