Results 241 to 250 of about 96,047 (264)
Some of the next articles are maybe not open access.
A Lower Bound for Cake Cutting
2003We prove that in a certain cake cutting model, every fair cake division protocol for n players must use O(n log n) cuts in the worst case. Up to a small constant factor, our lower bound matches a corresponding upper bound in the same model by Even & Paz from 1984.
Sgall, Jirí, Woeginger, Gerhard J.
openaire +3 more sources
Reliability Bounds for Multistate Systems with Multistate Components
Operations Research, 1985Kailash C Kapur
exaly
An augmented autoregressive distributed lag bounds test for cointegration
Economic Modelling, 2019Soo Khoon Goh
exaly
Validity, tightness, and forecasting power of risk premium bounds
Journal of Financial Economics, 2022exaly
Bounds of functional outputs for parabolic problems. Part II: Bounds of the exact solution
Computer Methods in Applied Mechanics and Engineering, 2008Núria Pares +2 more
exaly