• PAT

  • Referenced in 35 articles [sw13258]
  • fairness assumptions, refinement checking and probabilistic model checking. To achieve good performance, advanced optimization techniques...
  • SparsePR

  • Referenced in 18 articles [sw25721]
  • phase retrieval strategy that uses a near-optimal number of measurements, and is both computationally ... noise. In addition, the proposed strategy is fairly general, allowing for a large number...
  • COSSAN

  • Referenced in 9 articles [sw16555]
  • Stand Alone Tool Box covers a fairly wide field of stochastic methods including various sampling ... techniques, random fields, fatigue analysis, reliability based optimization, random vibration, Monte Carlo simulation...
  • Goshawk

  • Referenced in 0 articles [sw34781]
  • efficiency, potential selfish mining, to-be-optimized fairness and extreme inconvenience of protocol upgrading. Therefore...
  • HEMO

  • Referenced in 8 articles [sw02403]
  • proposing of a generic framework, named Hierarchical Fair Competition(HFC)[9], for robust and sustainable ... based Hierarchical Evolutionary Multi-objective Optimization framework (HEMO) is proposed, which is characterized...
  • popt4jlib

  • Referenced in 1 article [sw30640]
  • Popt4jlib: A Parallel/Distributed Optimization Library for Java. This paper describes the architectural design as well ... contains a fairly large number of meta-heuristic and other exact optimization algorithms parallel/distributed Java...
  • PELCR

  • Referenced in 4 articles [sw20841]
  • refer to as PELCR (parallel environment for optimal lambda-calculus reduction), relies on a strategy ... reduction of the communication overhead, and a fair policy for distributing dynamically originated load among...
  • NORD

  • Referenced in 1 article [sw39038]
  • extensive experience with both neural networks and optimization processes. Neural Operations Research and Development (NORD ... existing methods on novel datasets and fairly comparing results. Thus, it aims to make...
  • HODLRlib

  • Referenced in 3 articles [sw32777]
  • higher dimensions. Further, the solver has been optimized and the running time of the solver ... based on a KDTree. The solver is fairly general, works with minimal restrictions...
  • LIAD

  • Referenced in 1 article [sw02816]
  • capability to increase throughput while achieving competitive fairness among connections with the same TCP congestion ... Congestion Avoidance (CA) phase, an optimal shrink factor is first proposed for Adaptive Decreasing cwnd ... proposed LIAD outperforms other approaches in goodput, fairness, and friendliness under diverse heterogeneous wireless topologies...
  • Fortran-GA

  • Referenced in 8 articles [sw05064]
  • David Goldberg’s ”Genetic Algorithms in Search, Optimization and Machine Learning,” Addison-Wesley ... some tips from Goldberg I concocted a fairly versatile and modern GA (maybe...
  • ZKPDL

  • Referenced in 2 articles [sw30793]
  • while our interpreter performs a number of optimizations to lower both computational and space overhead ... provides an interface for using ecash and fair exchange protocols without requiring expert knowledge from...
  • RobBERT

  • Referenced in 2 articles [sw37743]
  • BERT, we used RoBERTa, a robustly optimized BERT approach, to train a Dutch language model ... language-specific tokenizers and the model’s fairness. We found that RobBERT improves state...
  • Elliot

  • Referenced in 1 article [sw37569]
  • nested K-folds Cross-Validation). Elliot optimizes hyperparameters (51 strategies) for several recommendation algorithms ... from accuracy to beyond-accuracy, bias, and fairness, and conducts statistical analysis (Wilcoxon and Paired...
  • YOLACT++

  • Referenced in 1 article [sw34916]
  • incorporating deformable convolutions into the backbone network, optimizing the prediction head with better anchor scales ... COCO at 33.5 fps, which is fairly close to the state-of-the-art approaches...
  • UniVerMec

  • Referenced in 1 article [sw35265]
  • convex objects. Furthermore, a verified global optimization algorithm is adapted so that ... provide a prototypical implementation and perform fair numerical comparisons between the different arithmetics. Finally...
  • Landau

  • Referenced in 1 article [sw35964]
  • number of free variables can be fairly large. One of the approaches to obtaining these ... analysis and, as a result, a highly optimized compiled code. Among other things, the language...
  • deep_speck

  • Referenced in 1 article [sw34578]
  • verify that this yields a globally fairly good model of the difference distribution of Speck32/64 ... policy based on a variant of Bayesian optimization which, together with our neural distinguishers...
  • Tempas

  • Referenced in 1 article [sw16298]
  • either purely navigational or (b) have sub-optimal search experience due to ineffective retrieval models ... time windows. Finally, Tempas operates as a fairly non-invasive indexing framework. By not dealing...
  • AIFS

  • Referenced in 14 articles [sw00023]
  • A considerable class of fractal sets can be...