Related papers: Algorithm to find an all-order in the running coup…
An integral equation is a way to encapsulate the relationships between a function and its integrals. We develop a systematic way of describing Volterra integral equations -- specifically an algorithm that reduces any separable Volterra…
In this paper, we present a multi-parent memetic algorithm (denoted by MPM) for solving the classic Linear Ordering Problem (LOP). The MPM algorithm integrates in particular a multi-parent recombination operator for generating offspring…
Given a bidirected ring with capacities and a demand graph, we present an approximation algorithm to the problem of finding the minimum $\alpha$ such that there exists a feasible unsplittable routing of the demands after multiplying each…
We describe a constructive procedure to separate overlapping infrared divergences in multi-loop integrals. Working with a parametric representation in D=4-2*epsilon dimensions, adequate subtractions lead to a Laurent series in epsilon,…
We compute the differential equations for the two remaining integral topologies contributing to the leading colour two-loop amplitudes for $pp \rightarrow t\bar{t}j$. We derive differential equations for the master integrals by solving the…
Q^2 evolution equations are important not only for describing hadron reactions in accelerator experiments but also for investigating ultrahigh-energy cosmic rays. The standard ones are called DGLAP evolution equations, which are…
We present an algorithm that evolves hard processes at the amplitude level by dressing them iteratively with (massless) quarks and gluons. The algorithm interleaves collinear emissions with soft emissions and includes Coulomb/Glauber…
The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…
In this paper we describe a quantum algorithm to solve sparse systems of nonlinear differential equations whose nonlinear terms are polynomials. The algorithm is nondeterministic and its expected resource requirements are polylogarithmic in…
We consider the airplane refueling problem, where we have a fleet of airplanes that can refuel each other. Each airplane is characterized by specific fuel tank volume and fuel consumption rate, and the goal is to find a drop out order of…
Current algorithms for large-scale industrial optimization problems typically face a trade-off: they either require exponential time to reach optimal solutions, or employ problem-specific heuristics. To overcome these limitations, we…
Integrated circuit design automation tools are essential for the feasibility of complex designs with millions of transistors. One of the steps performed within the process is the routing of interconnections between components of a circuit.…
An exact, number-conserving solution to the generalized, orbit-dependent pairing problem is derived by introducing an infinite-dimensional algebra. A method for obtaining eigenvalues and eigenvectors of the corresponding Hamiltonian is also…
Large-scale linear programs (LPs) arise in many decision systems, including ranking, allocation, and matching problems that must be solved repeatedly at massive scale. Prior work such as ECLIPSE and LinkedIn's open-source DuaLip showed that…
We perform a two-loop calculation in Light Cone Perturbation Theory (LCPT) to evaluate the next-to-leading order nonsinglet splitting function. Our calculation demonstrates the methodology and feasibility of performing higher order…
We present an algorithm to compute planar linkage topology and geometry, given a user-specified end-effector trajectory. Planar linkage structures convert rotational or prismatic motions of a single actuator into an arbitrarily complex…
Splitting methods for the numerical integration of differential equations of order greater than two involve necessarily negative coefficients. This order barrier can be overcome by considering complex coefficients with positive real part.…
This paper proposes a new distributed algorithm for solving linear systems associated with a sparse graph under a generalised diagonal dominance assumption. The algorithm runs iteratively on each node of the graph, with low complexities on…
Symplectic schemes are powerful methods for numerically integrating Hamiltonian systems, and their long-term accuracy and fidelity have been proved both theoretically and numerically. However direct applications of standard symplectic…
Given a weighted digraph D, finding the longest simple path is well known to be NP-hard. Furthermore, even giving an approximation algorithm is known to be NP-hard. In this paper we describe an efficient heuristic algorithm for finding long…