Results 1 to 10 of about 8,531,267 (380)

Quantum Optimization Problems [PDF]

open access: yesarXiv, 2002
Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations. This paper expands his framework to a quantum optimization problem using polynomial-time quantum computations and introduces the notion of an ...
C. H. Bennett   +14 more
arxiv   +4 more sources

Hybrid Solar Forecasting Method Based on Empirical Mode Decomposition and Back Propagation Neural Network [PDF]

open access: yesE3S Web of Conferences, 2021
In order to improve the accuracy of solar radiation prediction and optimize the energy management system. This study proposes a forecasting model based on empirical mode decomposition (EMD) and Back Propagation Neural Network (BPNN).
Aghmadi Ahmed   +4 more
doaj   +1 more source

Asymptotic optimality in stochastic optimization [PDF]

open access: yesThe Annals of Statistics, 2021
We study local complexity measures for stochastic convex optimization problems, providing a local minimax theory analogous to that of H jek and Le Cam for classical statistical problems. We give complementary optimality results, developing fully online methods that adaptively achieve optimal convergence guarantees.
Duchi, John C., Ruan, Feng
openaire   +4 more sources

Almost simplicial polytopes: the lower and upper bound theorems [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
this is an extended abstract of the full version. We study n-vertex d-dimensional polytopes with at most one nonsimplex facet with, say, d + s vertices, called almost simplicial polytopes.
Eran Nevo   +3 more
doaj   +1 more source

On BMRN*-colouring of planar digraphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2021
In a recent work, Bensmail, Blanc, Cohen, Havet and Rocha, motivated by applications for TDMA scheduling problems, have introduced the notion of BMRN*-colouring of digraphs, which is a type of arc-colouring with particular colouring constraints.
Julien Bensmail, Foivos Fioravantes
doaj   +1 more source

An optimization case study for solving a transport robot scheduling problem on quantum-hybrid and quantum-inspired hardware

open access: yesScientific Reports, 2023
We present a comprehensive case study comparing the performance of D-Waves’ quantum-classical hybrid framework, Fujitsu’s quantum-inspired digital annealer, and Gurobi’s state-of-the-art classical solver in solving a transport robot scheduling problem ...
Dominik Leib   +7 more
doaj   +1 more source

Optimal Configuration of Photovoltaic-wind-storage Microgrid for Agricultural Irrigation in Mountainous Areas [PDF]

open access: yesE3S Web of Conferences, 2021
Water and electricity supply for irrigation is difficult in remote mountainous areas. This paper explores agricultural irrigation systems’ integration mechanism, pumped storage power plants, and renewable power sources in mountainous areas to solve this ...
Zhang Yangyang   +4 more
doaj   +1 more source

Optimism [PDF]

open access: yesClinical Psychology Review, 2010
Optimism is an individual difference variable that reflects the extent to which people hold generalized favorable expectancies for their future. Higher levels of optimism have been related prospectively to better subjective well-being in times of adversity or difficulty (i.e., controlling for previous well-being).
Charles S, Carver   +2 more
openaire   +2 more sources

On interval number in cycle convexity [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2018
Recently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph convexity parameter called hull number for this new graph convexity they proposed, and they ...
Julio Araujo   +3 more
doaj   +1 more source

Optimally Stopped Optimization [PDF]

open access: yesPhysical Review Applied, 2016
We combine the fields of heuristic optimization and optimal stopping. We propose a strategy for benchmarking randomized optimization algorithms that minimizes the expected total cost for obtaining a good solution with an optimal number of calls to the solver.
Daniel A. Lidar, Walter Vinci
openaire   +4 more sources

Home - About - Disclaimer - Privacy