default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Bilenne
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Olivier Bilenne:
Parametrization and convergence of a primal-dual block-coordinate approach to linearly-constrained nonsmooth optimization. CoRR abs/2408.16424 (2024)- 2022
- [c7]Olivier Bilenne, Barbara Franci
, Paulin Jacquot, Nadia Oudjane, Mathias Staudigl, Cheng Wan:
A Privacy-preserving Decentralized Algorithm for Distribution Locational Marginal Prices. CDC 2022: 4143-4148 - 2021
- [j4]Olivier Bilenne:
Dispatching to parallel servers. Queueing Syst. Theory Appl. 99(3-4): 199-230 (2021) - [i3]Olivier Bilenne, Paulin Jacquot, Nadia Oudjane, Mathias Staudigl, Cheng Wan:
A privacy-preserving distributed computational approach for distributed locational marginal prices. CoRR abs/2103.14094 (2021) - 2020
- [j3]Olivier Bilenne, Panayotis Mertikopoulos, Elena Veronica Belmega:
Fast Optimization With Zeroth-Order Feedback in Distributed, Multi-User MIMO Systems. IEEE Trans. Signal Process. 68: 6085-6100 (2020) - [c6]Olivier Bilenne, Panayotis Mertikopoulos, Elena Veronica Belmega:
Derivative-Free Optimization over Multi-user MIMO Networks. NetGCooP 2020: 17-24 - [i2]Olivier Bilenne, Panayotis Mertikopoulos, Elena Veronica Belmega:
Fast Gradient-Free Optimization in Distributed Multi-User MIMO Systems. CoRR abs/2006.05445 (2020)
2010 – 2019
- 2019
- [p1]Esa Hyytiä, Rhonda Righter, Olivier Bilenne, Xiaohu Wu:
Dispatching Discrete-Size Jobs with Multiple Deadlines to Parallel Heterogeneous Servers. Systems Modeling: Methodologies and Tools 2019: 29-46 - 2018
- [i1]Olivier Bilenne:
One-step dispatching policy improvement in multiple-server queueing systems with Poisson arrivals. CoRR abs/1803.10688 (2018) - 2017
- [j2]Esa Hyytiä, Rhonda Righter, Olivier Bilenne, Xiaohu Wu:
Dispatching fixed-sized jobs with multiple deadlines to parallel heterogeneous servers. Perform. Evaluation 114: 32-44 (2017) - 2016
- [c5]Esa Hyytiä, Rhonda Righter, Olivier Bilenne, Xiaohu Wu:
Dispatching fixed-sized jobs with multiple deadlines to parallel heterogeneous servers. VALUETOOLS 2016 - 2012
- [c4]Olivier Bilenne:
Asynchronous dual descent for separable network optimisation. ACC 2012: 478-484
2000 – 2009
- 2008
- [c3]Olivier Bilenne:
Stochastic process estimation using the fault-tolerant interval functions. FUSION 2008: 1-8 - 2007
- [j1]Olivier Bilenne:
Integrity-directed sequential state estimation: Assessing high reliability requirements via safe confidence intervals. Inf. Fusion 8(1): 40-55 (2007) - [c2]Olivier Bilenne:
Design of fault-tolerant interval functions based on their large-sample properties. FUSION 2007: 1-8 - 2006
- [c1]Olivier Bilenne:
Integrity-Directed Sensor Fusion by Robust Risk Assessment of Fault-Tolerant Interval Functions. FUSION 2006: 1-8
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
