Results 21 to 30 of about 563,494 (247)
Clustering Improves the Goemans–Williamson Approximation for the Max-Cut Problem
Computation, 2020 MAX-CUT is one of the well-studied NP-hard combinatorial optimization problems. It can be formulated as an Integer Quadratic Programming problem and admits a simple relaxation obtained by replacing the integer “spin” variables xi by unitary vectors v→i ...
Angel E. Rodriguez-Fernandez +3 more
doaj +1 more source
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2022 Sports scheduling is the research region that concerns making a reasonable game schedule, especially a round-robin tournament, for sports competitions. One of the important factors in game scheduling is fairness.
Fei XUE, Haijunfu MA, Maiko SHIGENO
doaj +1 more source
Existence of Multispike Positive Solutions for a Nonlocal Problem in ℝ3
Advances in Mathematical Physics, 2020 In this paper, we study the following nonlinear Choquard equation −ϵ2Δu+Kxu=1/8πϵ2∫ℝ3u2y/x−ydyu,x∈ℝ3, where ϵ>0 and Kx is a positive bounded continuous potential on ℝ3.
Jing Yang, Qiuxiang Bian, Na Zhao
doaj +1 more source
Linear-Time FPT Algorithms via Network Flow [PDF]
, 2013 In the area of parameterized complexity, to cope with NP-Hard problems, we introduce a parameter k besides the input size n, and we aim to design algorithms (called FPT algorithms) that run in O(f(k)n^d) time for some function f(k) and constant d. Though
Iwata, Yoichi +2 more
core +1 more source
, 2020 The analytical solution for the propagation of the laser beam with optical vortex through the system of lenses is presented. The optical vortex is introduced into the laser beam (described as Gaussian beam) by spiral phase plate.
Augustyniak, Ireneusz +4 more
core +1 more source
On Pairwise Costs for Network Flow Multi-Object Tracking [PDF]
, 2015 Multi-object tracking has been recently approached with the min-cost network flow optimization techniques. Such methods simultaneously resolve multiple object tracks in a video and enable modeling of dependencies among tracks.
Chari, Visesh +3 more
core +1 more source
Identity-based incremental signature scheme from lattices
Tongxin xuebao, 2021 By taking ideas of identity-based cryptography into incremental signatures, the concept of identity-based incremental signature was proposed, and then a specific scheme from lattices was also constructed.The scheme was shown to be provably secure against
Miaomiao TIAN, Jing CHEN, Hong ZHONG
doaj +2 more sources
Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases [PDF]
Yugoslav Journal of Operations Research, 2005 The problem of finding a fundamental cycle basis with minimum total cost in a graph arises in many application fields. In this paper we present some integer linear programming formulations and we compare their performances, in terms of instance size, CPU
Liberti Leo +3 more
doaj +1 more source
Small Black Holes on Branes: Is the horizon regular or singular ?
, 2004 We investigate the following question: Consider a small mass, with $\epsilon$ (the ratio of the Schwarzschild radius and the bulk curvature length) much smaller than 1, that is confined to the TeV brane in the Randall-Sundrum I scenario.
C. Sahabandu +10 more
core +1 more source
Modeling and optimization of production and distribution of drinking water at VMW [PDF]
, 2011 We develop and discuss an operational planning model aiming at minimizing production and distribution costs in large drinking water networks containing buffers with free inflow.
B. Ulanicki +5 more
core +1 more source