E-LIB Suche - Ergebnisse für: Poloczek, Matthias

1

Multi-objective path planning for environmental monitoring ..:

, In: Proceedings of the Genetic and Evolutionary Computation Conference Companion,

Peralta, Federico ; Pearce, Michael ; Poloczek, Matthias... - p. 747-750 , 2022

Link: https://dl.acm.org/doi/1..

2

Tuning Materials-Binding Peptide Sequences toward Gold- and..:

Hughes, Zak E. ; Nguyen, Michelle A. ; Wang, Jialei...
ACS Nano. 15 (2021) 11 - p. 18260-18269 , 2021

Link: https://doi.org/10.1021/..

3

Cost-effective materials discovery: Bayesian optimization a..:

Herbol, Henry C. ; Poloczek, Matthias ; Clancy, Paulette
Materials Horizons. 7 (2020) 8 - p. 2113-2123 , 2020

Link: https://doi.org/10.1039/..

4

Bypassing Solid-State Intermediates by Solvent Engineering ..:

Ortoll-Bloch, Amnon G. ; Herbol, Henry C. ; Sorenson, Blaire A....
Crystal Growth & Design. 20 (2019) 2 - p. 1162-1171 , 2019

Link: https://doi.org/10.1021/..

5

Bayesian Simulation Optimization with Common Random Numbers:

, In: 2019 Winter Simulation Conference (WSC),

Pearce, Michael ; Poloczek, Matthias ; Branke, Juergen - p. 3492-3503 , 2019

Link: https://doi.org/10.1109/..

6

Bayesian simulation optimization with common random numbers:

, In: Proceedings of the Winter Simulation Conference,

Pearce, Michael ; Poloczek, Matthias ; Branke, Juergen - p. 3492-3503 , 2019

Link: https://dl.acm.org/doi/1..

7

Efficient search of compositional space for hybrid organic–..:

Herbol, Henry C. ; Hu, Weici ; Frazier, Peter..
npj Computational Materials. 4 (2018) 1 - p. , 2018

Link: https://doi.org/10.1038/..

8

Contagious sets in dense graphs:

Freund, Daniel ; Poloczek, Matthias ; Reichman, Daniel
European Journal of Combinatorics. 68 (2018) - p. 66-78 , 2018

Link: https://doi.org/10.1016/..

9

An Experimental Evaluation of Fast Approximation Algorithms..:

Poloczek, Matthias ; Williamson, David P.
ACM Journal of Experimental Algorithmics. 22 (2017) - p. 1-18 , 2017

Link: https://doi.org/10.1145/..

10

Greedy Algorithms for the Maximum Satisfiability Problem: S..:

Poloczek, Matthias ; Schnitger, Georg ; Williamson, David P..
SIAM Journal on Computing. 46 (2017) 3 - p. 1029-1061 , 2017

Link: https://doi.org/10.1137/..

11

Erratum to: Greedy Matching: Guarantees and Limitations:

Besser, Bert ; Poloczek, Matthias
Algorithmica. 80 (2017) 1 - p. 410-413 , 2017

Link: https://doi.org/10.1007/..

12

An Experimental Evaluation of Fast Approximation Algorithms..:

Poloczek, Matthias ; Williamson, David P.
Journal of Experimental Algorithmics (JEA). 22 (2017) 22 - p. 1-18 , 2017

Link: https://dl.acm.org/doi/1..

13

Simple Approximation Algorithms for Balanced MAX 2SAT:

Paul, Alice ; Poloczek, Matthias ; Williamson, David P.
Algorithmica. 80 (2017) 3 - p. 995-1012 , 2017

Link: https://doi.org/10.1007/..

14

Empirically comparing the finite-time performance of simula..:

, In: Proceedings of the 2017 Winter Simulation Conference,

Dong, Naijia (Anna) ; Eckman, David J. ; Zhao, Xueqi.. - p. 1-12 , 2017

Link: https://dl.acm.org/doi/1..

15

Warm starting Bayesian optimization:

, In: Proceedings of the 2016 Winter Simulation Conference,

Poloczek, Matthias ; Wang, Jialei ; Frazier, Peter I. - p. 770-781 , 2016

Link: https://dl.acm.org/doi/1..