Results 161 to 170 of about 2,420 (204)
gllvm 2.0: fast fitting of advanced ordination methods and joint species distribution models. [PDF]
PeerJKorhonen P +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Spectral bounds for unconstrained (−1,1)-quadratic optimization problems
European Journal of Operational Research, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ben-Ameur, Walid, Neto, José
openaire +2 more sources
Testing optimality for quadratic 0?1 unconstrained problems
ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research, 1995Summary: This paper analyses a necessary and sufficient condition for quadratic pseudo-Boolean unconstrained problems. It is proved that in general testing any necessary and sufficient optimality condition is a difficult task for any NP-hard problem. An \(\varepsilon\)-optimality condition is derived together with an approximation scheme to test it.
Carraresi, Paolo +2 more
openaire +1 more source
Probabilistic reasoning as quadratic unconstrained binary optimization
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2022Probabilistic reasoning is an important tool for using uncertainty in AI, especially for automated reasoning. Partial probability assessments are a way of expressing partial probabilistic knowledge on a set of events. These assessments contain only the information about "interesting"events (hence it can be easily assessed by an expert).
openaire +2 more sources
High‐throughput FPGA implementation for quadratic unconstrained binary optimization
Concurrency and Computation: Practice and Experience, 2021AbstractQuadratic unconstrained binary optimization (QUBO) is a combinatorial optimization problem. Since various NP‐hard problems such as the traveling salesman problem can be formulated as a QUBO instance, QUBO is used with a wide range of applications.
Hiroshi Kagawa +8 more
openaire +1 more source
Sufficient optimal conditions for unconstrained quadratic binary problems
12th International Symposium on Operations Research and its Applications in Engineering, Technology and Management (ISORA 2015), 2015In this article, we present several sufficient optimal conditions for unconstrained quadratic binary problems, which can be applied in algorithms combining with SDP relaxations in branch-and-bound approaches for the primal problem. These optimal conditions can work for many situations when the Lagrangian duality gap is not zero.
null Liu Liu +2 more
openaire +1 more source
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)
Journal of Heuristics, 2007We present a family of local-search-based heuristics for Quadratic Unconstrained Binary Optimization (QUBO), all of which start with a (possibly fractional) initial point, sequentially improving its quality by rounding or switching the value of one variable, until arriving to a local optimum. The effects of various parameters on the efficiency of these
Endre Boros +2 more
openaire +1 more source
Quadratic Unconstrained Binary Optimization (QUBO) on neuromorphic computing system
2017 International Joint Conference on Neural Networks (IJCNN), 2017The problems of Artificial intelligence (AI) naturally maps to NP-hard optimization problems. This trend has significance to achieve human-level computation capability from machines. This computational ability can be achieved by developing evolutionary algorithms or mapping those evolutionary algorithms onto new generation computing systems: Quantum or
Md Zahangir Alom +4 more
openaire +1 more source
A polynomial case of unconstrained zero-one quadratic optimization
Mathematical Programming, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Allemand, Kim +3 more
openaire +2 more sources