I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Improved Sample Complexity Bounds for Branch-And-Cut:
Balcan, Maria-Florina
;
Prasad, Siddharth
;
Sandholm, Tuomas
.
Is Part Of LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). , 2022
Link:
https://doi.org/10.4230/LIPIcs.CP.2022.3
RT Journal T1 <Title>Improved Sample Complexity Bounds for Branch-And-Cut</Title> UL https://suche.suub.uni-bremen.de/peid=base-ftdagstuhl:oai:drops-oai.dagstuhl.de:16632&Exemplar=1&LAN=DE A1 Balcan, Maria-Florina A1 Prasad, Siddharth A1 Sandholm, Tuomas A1 Vitercik, Ellen PB Schloss Dagstuhl – Leibniz-Zentrum für Informatik YR 2022 K1 Automated algorithm configuration K1 integer programming K1 machine learning theory K1 tree search K1 branch-and-bound K1 branch-and-cut K1 cutting planes K1 sample complexity K1 generalization guarantees K1 data-driven algorithm design JF Is Part Of LIPIcs, Volume 235, 28th International Conference on Principles and Practice of Constraint Programming (CP 2022) LK http://dx.doi.org/https://doi.org/10.4230/LIPIcs.CP.2022.3 DO https://doi.org/10.4230/LIPIcs.CP.2022.3 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
