Now showing items 41-50 of 3935
Zur Parallelisierung von Systemintegrationstests im E/E Umfeld
Future innovations in the motorring industry will be coined considerably by interlaced E/E components. In this connection the test of these components plays a crucial role. Usually so-called hardware-in-the-loop (HIL) test ...
Starke Gesetze für gewichtete Summen von Zufallsvariablen und Zufallsfeldern
The present work deals with strong laws of large numbers for weighted sums of random variables and random fields. In the first part, we work with independent, identically distributed, weighted random variables and a special ...
On random reductions from sparse sets to tally sets
We show that every sparse set S can be many-one reduced to an appropriate tally set T by a polynomial-time, randomized reduction (see formal definitions below). Since T is in NP if S is in NP, this result can be used to ...
Management datengetriebener Prozessstrukturen
Unternehmen erreichen ihre Geschäftsziele zunehmend durch das systematische Management ihrer Geschäftsprozesse. Um komplexe Geschäftsziele zu realisieren, lassen sich diese Prozesse meist verknüpfen und so Prozessstrukturen ...
Hybrid planning and scheduling
Planning and scheduling are well-established disciplines in the field of Artificial Intelligence. They provide flexibility, robustness, and effectiveness to complex software systems in a variety of application areas. While ...
Synthesized and inherited functions - a new computational model for syntax-directed semantics
In this paper we introduce a new formal model for the concept of syntax--directed semantics, called macro attributed tree transducer (for short: mat tree transducer). This model is based on (noncircular) attributed tree ...
A universal unification algorithm based on unification-driven leftmost outermost narrowing
We formalize a universal unification algorithm for the class of equational theories which is induced by the class of canonical, totally-defined, not strictly subunifiable term rewriting systems (for short: ctn-trs). For a ...
Graph isomorphism is low for PP
Compiler-based implementation of syntax-directed functional programming
We consider particular functional programs in which on the one hand the recursion is restricted to syntax-directed recursion and on the other hand simultaneous recursion and nesting of function calls in parameter positions ...
Complexity-restricted advice functions