• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Dynamic Evolution of Software Processes to Evolve Software Systems During Their Development

Beydeda, Sami, Gruhn, Volker 08 November 2018 (has links)
A software system, once deployed into its target environment, might need to be modified for various reasons. The reasons might be specific to that software system, such as failures, or, more general, such as changes in the environment in which the software system is embedded. Depending on the reason, a modification might obviously not only be restricted to a particular software system. It might also concern other existing software systems and particularly also software systems under development. The modification of a software system under development is merely a problem of modifying its development process, also called software process. Such modifications generally cannot be automatically carried out by autonomous process support systems due to the complexity inherent in software processes and in the necessary modifications. It usually needs to be guided by a human process manager. A process support system can, however, offer the human process manager certain services to assist in modifying a software process. One of these services is that of decision support.
2

Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences

Biyikoglu, Türker, Hellmuth, Marc, Leydold, Josef 08 November 2018 (has links)
Trees that have greatest maximum p-Laplacian eigenvalue among all trees with a given degree sequence are characterized. It is shown that such extremal trees can be obtained by breadth-first search where the vertex degrees are non-increasing. These trees are uniquely determined up to isomorphism. Moreover, their structure does not depend on p.

Page generated in 0.1281 seconds