NodeJS module for preprocessing Typescript sources and Embed Libraries
ASN.1 schema for the Time-Stamp Protocol (TSP) defined in RFC 3161.
Official Node.js client for TSP Scale Email and WhatsApp API
Node adaptation of google-maps-tsp-solver (https://code.google.com/p/google-maps-tsp-solver/)
A no-install web calculator to maximize TSP contributions and agency matching for federal employees.
TSP is a fork and superset of the TypeScript programming language which aims to implement features incompatible with the goals of TypeScript
Native module for the or-tools TSP / VRP solvers
The TypeSpec definition is an automatic import of [the OpenAI OpenAPI description](https://github.com/openai/openai-openapi) using [tsp-openapi3](https://www.npmjs.com/package/@typespec/openapi3).
cordova-plugin-tsp
A Typescript implementation of the Nearest Neighbor with 2-opt and 3-opt optimizations to solve the travelling salesman problem (TSP).
Scrapes TSP share prices from the TSP website.
TSP scaffolds and build Typescript sources to EcmaScript modules and publish them as modular packages to NPM
TimeStamp Protocol (TSP) in TypeScript
tsp-kafka
TSP solver
Native module for the or-tools TSP / VRP solvers
tsp
## This is a test package for @reflex-stack/tsp, do not use it
tsp-utils
Library with services for communicating with Tilde TSP platform
tsp-proxy
## This is a test package for @reflex-stack/tsp, do not use it
tsp和分堆算法js版本
tsp utils
An implementation of the TSP protocol used by Tendermint Core. Allows the building of COSMOS apps in Rust.
Shared timestamping (RFC 3161) and long-term validation (OCSP, CRL, trust stores) infrastructure for AdES signatures
Local TSP optimization with personalized .apr models
Trust Spanning Protocol (TSP) implementation for the Affinidi TDK
Rust implementation of the Trust Spanning Protocol
TSP tooling written in Rust.
A parser for TSPLIB format
A simple HTTP client for requesting timestamps from a timestamp authority (TSA) using the RFC 3161 standard.
A Rust Library for Solving the Travelling Salesman Problem (TSP)
Protocol-agnostic messaging traits for DIDComm and TSP
Pure Rust implementation of the Timestamping Protocol as described in RFC 3161.
Messaging Mediator service for Affinidi Messaging (DIDComm and TSP)
Scrapes fund price history from the TSP.gov website.
Prefixes a timestamp to each line of STDIN, and prints the result
qScript to run a TSP solver and validate/measure its output.
ant to solve travelling salesman
ant colony to solve travelling salesman
string helper
extremal optimization to solve travelling salesman
Strong params can end up making your controllers very fat and form objects aren't always the best cure. Tidy Strong Params (TSP) takes inspiration from ActiveModelSerialiers and aims to separate param white-listing from the rest of your controller logic whilst also allowing for flexibility in it's implementation. TSP provides a simple way for storing your list of white-listed params in their own directory, hopefully with minimal overhead
A spider for SEO.
tspec can check type of methods arguments and return value.
This is a general-purpose MPEG-TS parser.
== DESCRIPTION: Charlie is a library for genetic algorithms (GA) and genetic programming (GP). == FEATURES: - Quickly develop GAs by combining several parts (genotype, selection, crossover, mutation) provided by the library. - Sensible defaults are provided with any genotype, so often you only need to define a fitness function. - Easily replace any of the parts by your own code. - Test different strategies in GA, and generate reports comparing them. Example report: http://charlie.rubyforge.org/example_report.html == INSTALL: * sudo gem install charlie == EXAMPLES: This example solves a TSP problem (also quiz #142): N=5 CITIES = (0...N).map{|i| (0...N).map{|j| [i,j] } }.inject{|a,b|a+b} class TSP < PermutationGenotype(CITIES.size) def fitness d=0 (genes + [genes[0]]).each_cons(2){|a,b| a,b=CITIES[a],CITIES[b] d += Math.sqrt( (a[0]-b[0])**2 + (a[1]-b[1])**2 ) } -d # lower distance -> higher fitness. end use EdgeRecombinationCrossover, InversionMutator end Population.new(TSP,20).evolve_on_console(50) This example finds a polynomial which approximates cos(x) class Cos < TreeGenotype([proc{3*rand-1.5},:x], [:-@], [:+,:*,:-]) def fitness -[0,0.33,0.66,1].map{|x| (eval_genes(:x=>x) - Math.cos(x)).abs }.max end use TournamentSelection(4) end Population.new(Cos).evolve_on_console(500)
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.