Results 31 to 40 of about 151,821 (357)
Double-Constraint Fuzzy Clustering Algorithm
Applied SciencesGiven a set of data objects, the fuzzy c-means (FCM) partitional clustering algorithm is favored due to easy implementation, rapid response, and feasible optimization.
Shiyuan Zhu, Yuwei Zhao, Shihong Yue
doaj +1 more source
Short and long supports for constraint propagation
, 2013 Special-purpose constraint propagation algorithms frequently make implicit use of short supports -- by examining a subset of the variables, they can infer support (a justification that a variable-value pair may still form part of an assignment that ...
Gent, Ian Philip +3 more
core +1 more source
Breaking conditional symmetry in automated constraint modelling with CONJURE [PDF]
, 2014 This work was supported by UK EPSRC EP/K015745/1. Jefferson is supported by a Royal Society University Research Fellowship.Many constraint problems contain symmetry, which can lead to redundant search.
Gent, Ian +8 more
core +1 more source
Studies on Multi-Constraints Cooperative Guidance Method Based on Distributed MPC for Multi-Missiles
Applied Sciences, 2021 Cooperative terminal guidance with impact angle constraint is a key technology to achieve a saturation attack and improve combat effectiveness. The present study envisaged cooperative terminal guidance with impact angle constraint for multiple missiles ...
Mingyu Cong +3 more
doaj +1 more source
A Hybrid Continuous Max-Sum Algorithm for Decentralised Coordination
, 2010 Recent advances in decentralised coordination of multiple agents have led to the proposal of the max-sum algorithm for solving distributed constraint optimisation problems (DCOPs). The max-sum algorithm is fully decentralised, converges to optimality for
Jennings, Nick +3 more
core +1 more source
Bounded Approximate Decentralised Coordination via the Max-Sum Algorithm
, 2011 In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is based on a factor graph representation of the constraint network.
Farinelli, A. +14 more
core +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
Dominion : an architecture-driven approach to generating efficient constraint solvers
, 2011 This work is supported by the EPSRC grant “A Constraint Solver Synthesiser” (EP/H004092/1) and SICSA studentships.Constraints are used to solve combinatorial problems in a variety of industrial and academic disciplines.
Balasubramaniam, Dharini +11 more
core +1 more source
A better algorithm for random k-SAT [PDF]
, 2009 Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high probability for constraint densities m/n < (1 − εk)2k ln(k)/k, where εk → 0 ...
Coja-Oghlan, Amin, Amin Coja-Oghlan
core +1 more source
Molecular Oncology, EarlyView.Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson +9 more
wiley +1 more source