Results 91 to 100 of about 2,489,345 (220)
Regulatory Uncertainty and Inefficiency for the Development of Merchant Lines in Europe [PDF]
This paper evaluates regulatory uncertainty and inefficiency that may prevent merchant transmission investors from committing in Europe, in particular when they are dominant generators.
Adrien De Hauteclocque, Vincent Rious
core
Impaired Bestrophin Channel Activity in an iPSC-RPE Model of Best Vitelliform Macular Dystrophy (BVMD) from an Early Onset Patient Carrying the P77S Dominant Mutation [PDF]
Arnau Navinés‐Ferrer+3 more
openalex +1 more source
Local Approximability of Minimum Dominating Set on Planar Graphs [PDF]
We show that there is no deterministic local algorithm (constant-time distributed graph algorithm) that finds a $(7-\epsilon)$-approximation of a minimum dominating set on planar graphs, for any positive constant $\epsilon$. In prior work, the best lower bound on the approximation ratio has been $5-\epsilon$; there is also an upper bound of $52$.
arxiv
Advertising repetition and complexity of digital signage advertisements: simplicity rules! [PDF]
Digital signage is probably the most skyrocketing advertising medium of the moment, since the LCD-screens are almost impossible to avoid in everyday life for consumers, while few academic research is present to explore the potential of this medium.
Geuens, Maggie+2 more
core
We established exact in order estimates an approximation of the Sobolev classes $W^{\boldsymbol{r}}_{p,\boldsymbolα}(\mathbb{T}^d)$ of periodic functions of many variables with a bounded dominating mixed derivative. The approximation is made using trigonometric polynomials with the spectrum in step-hyperbolic crosses, and the error is estimated in the ...
Pozharska, K. V.+2 more
openaire +2 more sources
Air pollution has impacted people’s lives in urban China, and the analysis of the distribution and driving factors behind air quality has become a current research focus.
Xiangwei Zhao+6 more
doaj +1 more source
Improved upper bounds on the domination number of graphs with minimum degree at least five [PDF]
An algorithmic upper bound on the domination number $\gamma$ of graphs in terms of the order $n$ and the minimum degree $\delta$ is proved. It is demonstrated that the bound improves best previous bounds for any $5\le \delta \le 50$. In particular, for $\delta=5$, Xing et al.\ proved in 2006 that $\gamma \le 5n/14 < 0.3572 n$. This bound is improved to
arxiv
The reuse of industrial heritage sites has become increasingly prevalent in the context of hosting mega-events. This paper aims to investigate this trend, specifically in the context of Olympic Games or World Expos, and its impact on urban regeneration ...
Florence Graezer Bideau+2 more
doaj +1 more source
Extended Comparisons of Best Subset Selection, Forward Stepwise Selection, and the Lasso [PDF]
In exciting new work, Bertsimas et al. (2016) showed that the classical best subset selection problem in regression modeling can be formulated as a mixed integer optimization (MIO) problem. Using recent advances in MIO algorithms, they demonstrated that best subset selection can now be solved at much larger problem sizes that what was thought possible ...
arxiv
We study alternative market power mitigation measures in a model where a dominant producer faces a competitive fringe with the same cost structure. We characterise the asset divestment by the dominant firm which achieves the greatest reduction in prices.
Federico, Giulio, Lopez, Angel L.
core