• W12SC3

  • Referenced in 1 article [sw19876]
  • W12SC3: supersonic wing design and analysis. COREL and W12SC3 are two computer programs useful in the aerodynamic design and analysis of wings for supersonic maneuvering. ...
  • W2CWM2C

  • Referenced in 1 article [sw32637]
  • R package W2CWM2C: A Graphical Tool for Wavelet (Cross) Correlation and Wavelet Multiple (Cross) Correlation Analysis. Set of functions that improves the graphical presentations of ...
  • W3Bcrypt

  • Referenced in 1 article [sw30069]
  • W3Bcrypt: Encryption as a stylesheet. While web-based communications ( e.g., webmail or web chatrooms) are increasingly protected by transport-layer cryptographic mechanisms, such as the SSL/TLS ...
  • WADE

  • Referenced in 3 articles [sw08954]
  • WADE: a software platform to develop mission critical applications exploiting agents and workflow. In this paper, we describe two mission critical applications currently deployed by ...
  • waffle

  • Referenced in 0 articles [sw18464]
  • R package waffle. Create Waffle Chart Visualizations in R. Square pie charts (a.k.a. waffle charts) can be used to communicate parts of a whole for ...
  • Waffles

  • Referenced in 2 articles [sw08061]
  • Waffles: a machine learning toolkit. We present a breadth-oriented collection of cross-platform command-line tools for researchers in machine learning called Waffles. The Waffles tools are ...
  • WAFO

  • Referenced in 22 articles [sw07370]
  • WAFO is a toolbox of Matlab routines for statistical analysis and simulation of random waves and random loads. WAFO is freely redistributable software, see WAFO ...
  • WALA

  • Referenced in 2 articles [sw04113]
  • The T. J. Watson Libraries for Analysis (WALA) provide static analysis capabilities for Java bytecode and related languages and for JavaScript. The system is licensed ...
  • waLBerla

  • Referenced in 18 articles [sw01472]
  • waLBerla: Optimization for itanium-based systems with thousands of processors. Performance optimization is an issue at different levels, in particular for computing and communication intensive codes ...
  • waldi

  • Referenced in 1 article [sw28827]
  • R package waldi provides methods to compute location-adjusted Wald statistics and confidence intervals for popular model classes including glm and brglmFit (see the brglm2 R ...
  • Waldmeister

  • Referenced in 44 articles [sw19568]
  • Waldmeister is a theorem prover for unit equational logic. Its proof procedure is unfailing Knuth-Bendix completion [BDP89]. Waldmeister’s main advantage is that efficiency has been ...
  • WAlg

  • Referenced in 3 articles [sw25288]
  • MasterPVA and WAlg: Mathematica packages for Poisson vertex algebras and classical affine W-algebras. We give an introduction to the Mathematica packages ”MasterPVA” and ”MasterPVAmulti used ...
  • WALi

  • Referenced in 2 articles [sw33480]
  • WALi: the weighted automaton library.
  • WALi-NWA

  • Referenced in 0 articles [sw33481]
  • WALi: Nested-Word Automata. WALi-NWA is a C++ library for constructing, querying, and operating on nested-word automata. It is a portion of the WALi library, which ...
  • WalkCarefully

  • Referenced in 7 articles [sw19297]
  • ”The Quasi-Holonomic Ansatz and Restricted Lattice Walks” by Manuel Kauers and Doron Zeilberger. This article is accompanied by the following Maple packages ...
  • walker

  • Referenced in 1 article [sw35066]
  • R package walker: Bayesian Generalized Linear Models with Time-Varying Coefficients. Bayesian generalized linear models with time-varying coefficients. Gaussian, Poisson, and binomial observations are supported. The ...
  • walkr

  • Referenced in 1 article [sw29155]
  • walkr: MCMC Sampling from Non-Negative ConvexPolytopes.
  • Walks

  • Referenced in 7 articles [sw19291]
  • ”The Quasi-Holonomic Ansatz and Restricted Lattice Walks” by Manuel Kauers and Doron Zeilberger. This article is accompanied by the following Mathematica packages...
  • WALKSab

  • Referenced in 1 article [sw19263]
  • This is WALKSab That automatically generates, and solves the algebraic equations for the generating functions let’s call them F[0,i](x[a],x[-b]), for i=0,1, ..., b-1 for walks ...
  • Walksat

  • Referenced in 206 articles [sw04328]
  • GSAT and WalkSat are local search algorithms to solve Boolean satisfiability problems. Both algorithms work on formulae that are in, or have been converted into, ...