Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 64 for “"004 Informatik"”.
-
Superdominance order and distance of trees
The distance of a tree is the sum of the distances between all pairs of vertices in the tree. This thesis deals with the problem of determining the trees having minimum and maximum distance within certain subclasses of trees of a fixed order. Using a new approach based on a weaker variant of the …
-
Abstract state machines: verification problems and complexity
Abstract state machines (ASMs) provide the formal foundation for a successful methodology for specification and verification of complex dynamic systems. In addition, ASMs induce a computation model on structures, which – in some sense – is more powerful and universal than the standard computation …
-
Eliminating inefficient cross layer interactions in wireless networking
Wireless networking and more specifically, the performance problems that exist when protocols commonly used in the Internet run over wireless links, are high priority research topics in both academia and industry. Yet, a number of difficult problems remain unsolved. The root of these lies in …
-
Word re-ordering and dynamic programming based search algorithm for statistical machine translation
In this work, a new search procedure for statistical machine translation (SMT) is proposed that is based on dynamic programming (DP). The starting point is a DP solution to the traveling salesman problem that works by jointly processing tours that visit the same subset of cities. For SMT, the …
-
Baumrekursionen und Rekursionen mit unregelmäßigem Abstieg
Non-regular recursions, which do not satisfy the schema of linear difference equations, define sequences with non-uniform growth. A good example is the heap sequence, which counts the number of heaps with n nodes. An important result is a new representation of the heap sequence. In order to analyse …
-
Statistische Auswahl von Wortabhängigkeiten in der automatischen Spracherkennung
This PhD thesis studies the overall effect of statistical language modeling on perplexity and word error rate in automatic speech recognition. A trigram language model with a standard smoothing method is extended by complex state-of-the-art language modeling techniques, including: the comparison of …
-
Complexity results and practical algorithms for logics in knowledge representation
Description Logics (DLs) are used in knowledge-based systems to represent and reason about terminological knowledge of the application domain in a semantically well-defined manner. In this thesis, we establish a number of novel complexity results and give practical algorithms for expressive DLs …
-
Informatische Methoden zur Unterstützung von Transkription, Lokalisierung und Adressierung in kulturwissenschaftlichen Communities
The success of community information systems depends on a careful design of the digital media, and on the related tools for communication and collaboration. Particularly for the cultural sciences the community engine should be capable of supporting the discursive processes of hypermedia knowledge …
-
Evolutionäre Verfahren zur Optimierung von Produktionsplänen mittels implizierter Kooperation
This work describes a new approach to cooperative production planning and control using genetic algorithm and timed hierachical object-related Petri Nets. Every planning problem is decomposed into subproblems like scheduling, lotsizing etc. Each subproblem is solved independently of the other …
-
Visual knowledge management with adaptable document maps
Analyzing, structuring and organizing documented knowledge is an important aspect of knowledge management. In literature so-called document maps have been proposed for visualizing the semantic similarity structure of a corpus of documents. So far, however, a method which is specifically designed …
-
Statistical machine translation : from single-word models to alignment templates
In this work, new approaches for machine translation using statistical methods are described. In addition to the standard source-channel approach to statistical machine translation, a more general approach based on the maximum entropy principle is presented. Various methods for computing …
-
Strategiesynthese für Paritätsspiele auf endlichen Graphen
Parity games are infinite two person games, here considered on finite graphs. A play is an infinite path in the graph, whose vertices are chosen by the two players in alternation. The winner of the play is determined by the vertices that are visited infinitely often in the play. The problem of …
Page 1 of 4