LIVIVO - The Search Portal for Life Sciences

zur deutschen Oberfläche wechseln
Advanced search

Search results

Result 1 - 8 of total 8

Search options

  1. Book ; Online ; Thesis: Extremal colorings and extremal satisfiability

    Zumstein, Philipp

    2009  

    Author's details by Philipp Zumstein
    Language English
    Size Online-Ressource (1 Band), Ill
    Publisher ETH
    Publishing place Zürich
    Document type Book ; Online ; Thesis
    Thesis / German Habilitation thesis Diss., Eidgenössische Technische Hochschule ETH Zürich, Nr. 18603--Zürich, 1860
    Database Library catalogue of the German National Library of Science and Technology (TIB), Hannover

    More links

    Kategorien

  2. Book ; Online ; Thesis: Extremal colorings and extremal satisfiability

    Zumstein, Philipp

    2009  

    Author's details by Philipp Zumstein
    Language English
    Size Online-Ressource (1 Band), Ill
    Publisher ETH
    Publishing place Zürich
    Document type Book ; Online ; Thesis
    Thesis / German Habilitation thesis Diss., Eidgenössische Technische Hochschule ETH Zürich, Nr. 18603--Zürich, 1860
    Database Former special subject collection: coastal and deep sea fishing

    More links

    Kategorien

  3. Article ; Online: Erfahrungen bei der Organisation und Durchführung des KIM Workshops 2020 als Online-Veranstaltung

    Hentschke, Jana / Hulin, Sylvia / Zumstein, Philipp

    2020  

    Abstract: Am 4./5. Mai 2020 fand der 10. KIM Workshop statt. Durch die COVID-19-Pandemie konnte die Veranstaltung nicht wie gewohnt in Mannheim abgehalten werden, sondern wurde kurzerhand in eine Online-Veranstaltung umgewandelt. Im Folgenden möchten wir auf ... ...

    Abstract Am 4./5. Mai 2020 fand der 10. KIM Workshop statt. Durch die COVID-19-Pandemie konnte die Veranstaltung nicht wie gewohnt in Mannheim abgehalten werden, sondern wurde kurzerhand in eine Online-Veranstaltung umgewandelt. Im Folgenden möchten wir auf einige organisatorische Punkte dieser Online-Veranstaltung eingehen und unsere Erfahrungen dabei für andere Online-Veranstalter teilen. Zudem haben wir gegen Ende des Online-Workshops auch einige Fragen an die TeilnehmerInnen gestellt, welche hier zusammen mit den Antworten integriert werden.
    Keywords 020 Bibliotheks- und Informationswissenschaft ; covid19
    Language German
    Publisher Universitätsbibliothek
    Publishing country de
    Document type Article ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    More links

    Kategorien

  4. Thesis ; Online: Extremal colorings and extremal satisfiability

    Zumstein, Philipp

    2009  

    Keywords EXTREMAL PROBLEMS (GRAPH THEORY) ; SATISFIABILITY (MATHEMATICS) ; RAMSEY-THEORIE (KOMBINATORIK) ; RAMSEY THEORY (COMBINATORICS) ; ERFÜLLBARKEIT (MATHEMATIK) ; ALGORITHMISCHE KOMPLEXITÄT (MATHEMATIK) ; COLOURING OF GRAPHS (GRAPH THEORY) ; EXTREMALPROBLEME (GRAPHENTHEORIE) ; ALGORITHMIC COMPLEXITY (MATHEMATICS) ; FARBENPROBLEME (GRAPHENTHEORIE) ; info:eu-repo/classification/ddc/004 ; info:eu-repo/classification/ddc/510 ; Data processing ; computer science ; Mathematics
    Language English
    Publisher ETH
    Publishing country ch
    Document type Thesis ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    More links

    Kategorien

  5. Book ; Online ; Thesis: Extremal colorings and extremal satisfiability

    Zumstein, Philipp / Welzl, Emo

    2009  

    Author's details Philipp Zumstein. Betreuer: Emo Welzl
    Language German
    Size Online-Ressource
    Publisher Universitätsbibliothek Mannheim
    Publishing place Mannheim
    Document type Book ; Online ; Thesis
    Thesis / German Habilitation thesis Techn. Hochsch., Diss.--Zürich, 2009
    Database Former special subject collection: coastal and deep sea fishing

    More links

    Kategorien

  6. Book ; Online: Unsatisfiable CNF Formulas need many Conflicts

    Scheder, Dominik / Zumstein, Philipp

    2008  

    Abstract: A pair of clauses in a CNF formula constitutes a conflict if there is a variable that occurs positively in one clause and negatively in the other. A CNF formula without any conflicts is satisfiable. The Lovasz Local Lemma implies that a k-CNF formula is ... ...

    Abstract A pair of clauses in a CNF formula constitutes a conflict if there is a variable that occurs positively in one clause and negatively in the other. A CNF formula without any conflicts is satisfiable. The Lovasz Local Lemma implies that a k-CNF formula is satisfiable if each clause conflicts with at most 2^k/e-1 clauses. It does not, however, give any good bound on how many conflicts an unsatisfiable formula has globally. We show here that every unsatisfiable k-CNF formula requires 2.69^k conflicts and there exist unsatisfiable k-CNF formulas with 3.51^k conflicts.

    Comment: new version; added an upper bound on the number of conflicts
    Keywords Computer Science - Discrete Mathematics
    Publishing date 2008-06-06
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    More links

    Kategorien

  7. Article ; Online: Eleven strategies for making reproducible research and open science training the norm at research institutions.

    Kohrs, Friederike E / Auer, Susann / Bannach-Brown, Alexandra / Fiedler, Susann / Haven, Tamarinde Laura / Heise, Verena / Holman, Constance / Azevedo, Flavio / Bernard, René / Bleier, Arnim / Bössel, Nicole / Cahill, Brian Patrick / Castro, Leyla Jael / Ehrenhofer, Adrian / Eichel, Kristina / Frank, Maximillian / Frick, Claudia / Friese, Malte / Gärtner, Anne /
    Gierend, Kerstin / Grüning, David Joachim / Hahn, Lena / Hülsemann, Maren / Ihle, Malika / Illius, Sabrina / König, Laura / König, Matthias / Kulke, Louisa / Kutlin, Anton / Lammers, Fritjof / Mehler, David M A / Miehl, Christoph / Müller-Alcazar, Anett / Neuendorf, Claudia / Niemeyer, Helen / Pargent, Florian / Peikert, Aaron / Pfeuffer, Christina U / Reinecke, Robert / Röer, Jan Philipp / Rohmann, Jessica L / Sánchez-Tójar, Alfredo / Scherbaum, Stefan / Sixtus, Elena / Spitzer, Lisa / Straßburger, Vera Maren / Weber, Marcel / Whitmire, Clarissa J / Zerna, Josephine / Zorbek, Dilara / Zumstein, Philipp / Weissgerber, Tracey L

    eLife

    2023  Volume 12

    Abstract: Reproducible research and open science practices have the potential to accelerate scientific progress by allowing others to reuse research outputs, and by promoting rigorous research that is more likely to yield trustworthy results. However, these ... ...

    Abstract Reproducible research and open science practices have the potential to accelerate scientific progress by allowing others to reuse research outputs, and by promoting rigorous research that is more likely to yield trustworthy results. However, these practices are uncommon in many fields, so there is a clear need for training that helps and encourages researchers to integrate reproducible research and open science practices into their daily work. Here, we outline eleven strategies for making training in these practices the norm at research institutions. The strategies, which emerged from a virtual brainstorming event organized in collaboration with the German Reproducibility Network, are concentrated in three areas: (i) adapting research assessment criteria and program requirements; (ii) training; (iii) building communities. We provide a brief overview of each strategy, offer tips for implementation, and provide links to resources. We also highlight the importance of allocating resources and monitoring impact. Our goal is to encourage researchers - in their roles as scientists, supervisors, mentors, instructors, and members of curriculum, hiring or evaluation committees - to think creatively about the many ways they can promote reproducible research and open science practices in their institutions.
    MeSH term(s) Humans ; Reproducibility of Results ; Mentors ; Personnel Selection ; Physicians ; Research Personnel
    Language English
    Publishing date 2023-11-23
    Publishing country England
    Document type Journal Article
    ZDB-ID 2687154-3
    ISSN 2050-084X ; 2050-084X
    ISSN (online) 2050-084X
    ISSN 2050-084X
    DOI 10.7554/eLife.89736
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

  8. Book ; Online: Minimum and maximum against k lies

    Hoffmann, Michael / Matoušek, Jiří / Okamoto, Yoshio / Zumstein, Philipp

    2010  

    Abstract: A neat 1972 result of Pohl asserts that [3n/2]-2 comparisons are sufficient, and also necessary in the worst case, for finding both the minimum and the maximum of an n-element totally ordered set. The set is accessed via an oracle for pairwise ... ...

    Abstract A neat 1972 result of Pohl asserts that [3n/2]-2 comparisons are sufficient, and also necessary in the worst case, for finding both the minimum and the maximum of an n-element totally ordered set. The set is accessed via an oracle for pairwise comparisons. More recently, the problem has been studied in the context of the Renyi-Ulam liar games, where the oracle may give up to k false answers. For large k, an upper bound due to Aigner shows that (k+O(\sqrt{k}))n comparisons suffice. We improve on this by providing an algorithm with at most (k+1+C)n+O(k^3) comparisons for some constant C. The known lower bounds are of the form (k+1+c_k)n-D, for some constant D, where c_0=0.5, c_1=23/32=0.71875, and c_k=\Omega(2^{-5k/4}) as k goes to infinity.

    Comment: 11 pages, 3 figures
    Keywords Computer Science - Data Structures and Algorithms ; Computer Science - Computational Complexity ; Computer Science - Computer Science and Game Theory ; F.2.2 ; F.1.2 ; G.2.1
    Publishing date 2010-02-02
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    More links

    Kategorien

To top