oru.sePublications
Change search
Refine search result
1 - 8 of 8
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1. Bierbrauer, Jürgen
    et al.
    Schellwat, Holger
    Örebro University, Department of Natural Sciences.
    Almost independent and weakly biased arrays: efficient constructions and cryptologic applications2000In: Advances in cryptology: CRYPTO 2000 / [ed] Mihir Bellare, Springer Berlin/Heidelberg, 2000, p. 533-543Conference paper (Other academic)
  • 2. Bierbrauer, Jürgen
    et al.
    Schellwat, Holger
    Örebro University, Department of Natural Sciences.
    Weakly biased arrays, almost independent arrays and error-correcting codes2001In: Codes and association schemes / [ed] Alexander Barg, Simon Litsyn, Providence, R.I.: American Mathematical Society , 2001, p. 33-46Conference paper (Other academic)
  • 3.
    Schellwat, Holger
    Örebro University, School of Science and Technology. Universidade Eduardo Mondlane, Maputo, Mocambique.
    A Gentle Introduction to a Beautiful Theorem of Molien2017Report (Other (popular science, discussion, etc.))
    Abstract [en]

    The purpose of this note is to give an accessible proof of Moliens Theorem in Invariant Theory, in the language of today's Linear Algebra and Group Theory, in order to prevent this beautiful theorem from being forgotten.

  • 4.
    Schellwat, Holger
    Örebro University, Department of Natural Sciences.
    A simple slide rule for finite fields2001In: The American mathematical monthly, ISSN 0002-9890, E-ISSN 1930-0972, Vol. 108, no 4, p. 358-360Article in journal (Refereed)
  • 5.
    Schellwat, Holger
    Technische Universität Braunschweig, Germany.
    Highly expanding graphs obtained from dihedral groups1993In: Expanding graphs: proceedings of a DIMACS workshop, May 11-14, 1992 / [ed] Joel Friedman, Providence, RI: American Mathematical Society (AMS), 1993, p. 117-124Chapter in book (Other academic)
  • 6.
    Schellwat, Holger
    Örebro University, Department of Natural Sciences.
    Induced Cayley graphs and double covers1995In: Linear and multilinear algebra, ISSN 0308-1087, E-ISSN 1563-5139, Vol. 39, no 1-2, p. 161-164Article in journal (Refereed)
  • 7.
    Schellwat, Holger
    Örebro University, School of Science and Technology.
    Mutual benefits from combining ethnomusicology with ethnomathematics2016In: Music in an intercultural perspective / [ed] Antenor Ferreira Corrêa, Brasília: Strong Edições , 2016, p. 119-122Chapter in book (Other academic)
  • 8.
    Wide, Peter
    et al.
    Örebro University, Department of Technology.
    Schellwat, Holger
    Örebro University, Department of Natural Sciences.
    Implementation of a Genetic Algorithm for Routing an Autonomous Robot1997In: Robotica (Cambridge. Print), ISSN 0263-5747, E-ISSN 1469-8668, Vol. 15, no 2, p. 207-211Article in journal (Refereed)
    Abstract [en]

    A practical implementation of a genetic algorithm for routing a real autonomous robot through a changing environment is described. Moving around in a production plant the robot collects information about its environment and stores it in a temporal map, which is virtually a square grid, taking account of changing obstacles. The evolutional optimizer continuously searches for short paths in this map using string representations of paths as chromosomes. The main features of the implementation include physical realization, random walk exploration, temporal mapping, and dedicated genetic operators.

1 - 8 of 8
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf