The following pages link to describes a project that uses (P1463):
Displaying 50 items.
- Mathematical frameworks for oscillatory network dynamics in neuroscience (Q271683) (← links)
- Densification of FL chains via residuated frames (Q271692) (← links)
- Computing transition rates for the 1-D stochastic Ginzburg-Landau-Allen-Cahn equation for finite-amplitude noise with a rare event algorithm (Q271705) (← links)
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey (Q271706) (← links)
- Runtime verification for biochemical programs (Q271709) (← links)
- Hybrid automata as a modelling approach in the behavioural sciences (Q271714) (← links)
- Reachability analysis of linear systems with stepwise constant inputs (Q271719) (← links)
- The Euclid-Mullin graph (Q271751) (← links)
- On products of disjoint blocks of arithmetic progressions and related equations (Q271755) (← links)
- Computation of integral bases (Q271785) (← links)
- On holomorphic Riemannian geometry and submanifolds of Wick-related spaces (Q271816) (← links)
- Summable family in a commutative group (Q271890) (← links)
- Topology from neighbourhoods (Q271891) (← links)
- Torsion part of \(\mathbb{Z}\)-module (Q271895) (← links)
- Event-based proof of the mutual exclusion property of Peterson's algorithm (Q271900) (← links)
- Propositional linear temporal logic with initial validity semantics (Q271908) (← links)
- Stone lattices. (Q271910) (← links)
- An estimate of the objective function optimum for the network Steiner problem (Q271950) (← links)
- Short-term balancing of supply and demand in an electricity system: forecasting and scheduling (Q271971) (← links)
- A spatiotemporal data envelopment analysis (S-T DEA) approach: the need to assess evolving units (Q271975) (← links)
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (Q271978) (← links)
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions (Q271981) (← links)
- Decomposition algorithm for large-scale two-stage unit-commitment (Q271986) (← links)
- Extension of grey relational analysis for facilitating group consensus to oil spill emergency management (Q271989) (← links)
- Hybrid constructive heuristics for the critical node problem (Q271993) (← links)
- \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- The salesman and the tree: the importance of search in CP (Q272000) (← links)
- Strong local consistency algorithms for table constraints (Q272003) (← links)
- Structural decompositions for problems with global constraints (Q272005) (← links)
- Fast, flexible MUS enumeration (Q272009) (← links)
- On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity (Q272014) (← links)
- Quantified maximum satisfiability (Q272016) (← links)
- Balancing bike sharing systems with constraint programming (Q272022) (← links)
- Dynamics of minimally coupled dark energy in spherical halos of dark matter (Q272042) (← links)
- Influence measures and stability for graphical models (Q272066) (← links)
- Efficiency in multivariate functional nonparametric models with autoregressive errors (Q272071) (← links)
- Simultaneous variable selection and de-coarsening in multi-path change-point models (Q272078) (← links)
- Estimation of eigenvalues, eigenvectors and scores in FDA models with dependent errors (Q272079) (← links)
- Detecting weak signals in high dimensions (Q272081) (← links)
- Semi-parametric survival function estimators deduced from an identifying Volterra type integral equation (Q272086) (← links)
- Modular forms and Weierstrass mock modular forms (Q272106) (← links)
- Exploiting the guilt aversion of others: do agents do it and is it effective? (Q272145) (← links)
- A data-centric approach to manage business processes (Q272165) (← links)
- Quiz games as a model for information hiding (Q272185) (← links)
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- Optimal sampling points in reproducing kernel Hilbert spaces (Q272199) (← links)
- How to identify the physiological parameters and run the optimal race (Q272208) (← links)
- Declarative event based models of concurrency and refinement in psi-calculi (Q272301) (← links)
- Contracts as games on event structures (Q272306) (← links)
