The following pages link to (Q3651735):
Displaying 50 items.
- A practical approximation algorithm for the LTS estimator (Q1659190) (← links)
- Multiaspect graphs: algebraic representation and algorithms (Q1662581) (← links)
- Conditions for duality between fluxes and concentrations in biochemical networks (Q1664420) (← links)
- A comparison of different methods for calculating tangent-stiffness matrices in a massively parallel computational peridynamics code (Q1668400) (← links)
- Multisynchronization for coupled multistable fractional-order neural networks via impulsive control (Q1674974) (← links)
- Verification of detectability in probabilistic finite automata (Q1678629) (← links)
- Asymptotic stability in probability for stochastic Boolean networks (Q1679063) (← links)
- The block retrieval problem (Q1681149) (← links)
- An abstract model for branching and its application to mixed integer programming (Q1683695) (← links)
- An improved algorithm for computing a shortest watchman route for lines (Q1685027) (← links)
- A fast algorithm for the gas station problem (Q1685029) (← links)
- A transfer method from bounded existential Diophantine equations to Tarski algebra formulas (Q1686076) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Fast finite element calculation of effective conductivity of random continuum microstructures: the recursive Poincaré-Steklov operator method (Q1686601) (← links)
- Exact optimal sample allocation: more efficient than Neyman (Q1687190) (← links)
- Enriched curves and their tropical counterpart (Q1687880) (← links)
- A new algorithm for Chebyshev minimum-error multiplication of reduced affine forms (Q1689460) (← links)
- The closest vector problem in tensored root lattices of type A and in their duals (Q1692156) (← links)
- On the existence of a cherry-picking sequence (Q1694728) (← links)
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities (Q1694821) (← links)
- Hamiltonian tetrahedralizations with Steiner points (Q1694976) (← links)
- Object-oriented backtracking (Q1698575) (← links)
- An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem (Q1698703) (← links)
- On the string consensus problem and the Manhattan sequence consensus problem (Q1698720) (← links)
- Co-scheduling algorithms for high-throughput workload execution (Q1702725) (← links)
- Periodicity of identifying codes in strips (Q1708274) (← links)
- Convex-hull algorithms: implementation, testing, and experimentation (Q1712057) (← links)
- Uniqueness of solutions to fuzzy relational equations regarding max-av composition and strong regularity of the matrices in max-av algebra (Q1717012) (← links)
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (Q1722647) (← links)
- Moving target search optimization -- a literature review (Q1722971) (← links)
- Level-based analysis of the univariate marginal distribution algorithm (Q1725648) (← links)
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles (Q1725748) (← links)
- Robust topological policy iteration for infinite horizon bounded Markov decision processes (Q1726357) (← links)
- A biobjective Dijkstra algorithm (Q1728479) (← links)
- Algorithmic aspects of semitotal domination in graphs (Q1731849) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- Optimization models of anti-terrorist protection (Q1735316) (← links)
- A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Q1736548) (← links)
- A benchmarking algorithm to determine minimum aggregation delay for data gathering trees and an analysis of the diameter-aggregation delay tradeoff (Q1736674) (← links)
- Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications (Q1737742) (← links)
- On-line weighted pattern matching (Q1740646) (← links)
- Discovering outlying aspects in large datasets (Q1741290) (← links)
- Anytime parallel density-based clustering (Q1741415) (← links)
- Routing in unit disk graphs (Q1742368) (← links)
- Comparison-based buffer management in QoS switches (Q1742380) (← links)
- A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols (Q1744440) (← links)
- Improvised divide and conquer approach for the LIS problem (Q1748198) (← links)
- Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- Fuzzy clustering using the convex hull as geometrical model (Q1750199) (← links)
