Buscar
Mostrando ítems 1-10 de 1976
The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
(SOC BRASILEIRA MATEMATICA APLICADA & COMPUTACIONAL, 2010)
This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this ...
Best-case lower bounds in online learning
(2021)
Much of the work in online learning focuses on the study of sublinear upper bounds on the regret. In this work, we initiate the study of best-case lower bounds in online convex optimization, wherein we bound the largest ...
Lower bounding schemes for flowshops with blocking in-process
(Palgrave Publishers LtdBasingstokeInglaterra, 2001)
Lower bounds for the area of black holes in terms of mass, charge, and angular momentum
(Amer Physical Soc, 2013-06)
The most general formulation of Penrose’s inequality yields a lower bound for Arnowitt-Deser-Misner mass in terms of the area, charge, and angular momentum of black holes. This inequality is in turn equivalent to an upper ...
TIGHT QUANTUM BOUNDS FOR COMPUTATIONAL GEOMETRY PROBLEMS
(World Scientific Publ Co Pte LtdSingaporeSingapura, 2009)
Lower bounds for resonance widths in potential and obstacle scattering
(1990)
Explicit lower bounds are given for the size of the imaginary parts of resonances for Schrodinger operators with non-trapping or trapping potentials, and for the Dirichlet Laplacian in the exterior of a star-shaped obstacle, ...
A numerical study of the Lieb-Thirring kinetic energy lower bound
(Taylor and Francis, 2016)
In this work, the Lieb-Thirring kinetic energy bound is numerically examined for a variety of systems: the hydrogen-like atoms, neutral atoms, isoelectronic series of atomic ions, the Hooke's atom and some small molecules. ...
Tight lower bounds on the number of bicliques in false-twin-free graphs
(Elsevier Science, 2016-07)
A biclique is a maximal bipartite complete induced subgraph of G. Bicliques have been studied in the last years motivated by the large number of applications. In particular, enumeration of the maximal bicliques has been ...
Lower bounding the optimal LZ78-parsing
(2001-01-01)
A simple sequential algorithm that can compute a lower bound to the number of phrases produced by the optimal parsing procedure was developed and tested. Results were compared to the number of phrases produced by two ...