Results 11 to 20 of about 109,850 (269)

Compositional optimizations for CertiCoq [PDF]

open access: yesProceedings of the ACM on Programming Languages, 2021
Compositional compiler verification is a difficult problem that focuses on separate compilation of program components with possibly different verified compilers. Logical relations are widely used in proving correctness of program transformations in higher-order languages; however, they do not scale to compositional verification of multi ...
Zoe Paraskevopoulou   +2 more
openaire   +1 more source

On the optimal composition of committees [PDF]

open access: yesSocial Choice and Welfare, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ben-Yashar, Ruth, Danziger, Leif
openaire   +7 more sources

Optimizing haemodialysate composition [PDF]

open access: yesClinical Kidney Journal, 2015
Survival and quality of life of dialysis patients are strictly dependent on the quality of the haemodialysis (HD) treatment. In this respect, dialysate composition, including water purity, plays a crucial role. A major aim of HD is to normalize predialysis plasma electrolyte and mineral concentrations, while minimizing wide swings in the patient's ...
Locatelli, Francesco   +4 more
openaire   +2 more sources

Federated Composite Optimization

open access: yesCoRR, 2020
Accepted to ICML 2021.
Honglin Yuan 0002   +2 more
openaire   +3 more sources

Optimizing the coherence of composite networks [PDF]

open access: yes2017 American Control Conference (ACC), 2017
We consider how to connect a set of disjoint networks to optimize the performance of the resulting composite network. We quantify this performance by the coherence of the composite network, which is defined by an $H_2$ norm of the system. Two dynamics are considered: noisy consensus dynamics with and without stubborn agents.
Erika Mackin, Stacy Patterson
openaire   +2 more sources

Optimizing password composition policies [PDF]

open access: yesProceedings of the fourteenth ACM conference on Electronic commerce, 2013
A password composition policy restricts the space of allowable passwords to eliminate weak passwords that are vulnerable to statistical guessing attacks. Usability studies have demonstrated that existing password composition policies can sometimes result in weaker password distributions; hence a more principled approach is needed.
Jeremiah Blocki   +3 more
openaire   +2 more sources

Decentralized Composite Optimization with Compression

open access: yesCoRR, 2021
Decentralized optimization and communication compression have exhibited their great potential in accelerating distributed machine learning by mitigating the communication bottleneck in practice. While existing decentralized algorithms with communication compression mostly focus on the problems with only smooth components, we study the decentralized ...
Yao Li 0039   +4 more
openaire   +2 more sources

Consistent approximations in composite optimization

open access: yesMathematical Programming, 2022
Approximations of optimization problems arise in computational procedures and sensitivity analysis. The resulting effect on solutions can be significant, with even small approximations of components of a problem translating into large errors in the solutions.
openaire   +2 more sources

Optimal Weighting for Exam Composition [PDF]

open access: yesEducation Sciences, 2018
A problem faced by many instructors is that of designing exams that accurately assess the abilities of the students. Typically, these exams are prepared several days in advance, and generic question scores are used based on rough approximation of the question difficulty and length.
Ganzfried, Sam, Yusuf, Farzana
openaire   +3 more sources

An optimal method for stochastic composite optimization [PDF]

open access: yesMathematical Programming, 2011
The stochastic composite optimization problem under consideration consists in minimizing the sum \(f+h\) of two convex functions \(f,h\) defined on a compact convex set \(X\subset \mathbb{R}^{n}\), assuming that \(\nabla f\) and \(h\) are globally Lipschitz.
openaire   +1 more source

Home - About - Disclaimer - Privacy