Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Elmar Böhler"'
Publikováno v:
SAE Technical Paper Series.
Publikováno v:
Journal of Energy Storage. 49:104060
Publikováno v:
SAE Technical Paper Series.
Publikováno v:
ATZ - Automobiltechnische Zeitschrift. 110:878-884
Bei steigenden Kraftstoffpreisen werden verbrauchsarme Fahrzeuge fur die Kunden immer attraktiver. Ferner besteht ein wesentlicher Zielkonflikt zwischen der Umweltvertraglichkeit moderner Fahrzeuge durch CO2-Reduktion bei gleichzeitiger Optimierung d
Publikováno v:
ATZ worldwide. 110:14-19
Against the background of rising fuel prices, fuel-efficient vehicles are becoming more and more attractive to customers. Moreover, there is a major conflict of objectives involving the demand for environmental compatibility in modern vehicles — ac
Autor:
Henning Schnoor, Elmar Böhler
Publikováno v:
Theory of Computing Systems. 41:753-777
Any Boolean function can be defined by a Boolean circuit, provided we may use sufficiently strong functions in its gates. On the other hand, what Boolean functions can be defined depends on these gate functions: Each set B of gate functions defines t
Publikováno v:
Journal of Computer and System Sciences. 72:1043-1076
We introduce the probabilistic class SBP. This class emerges from BPP by keeping the promise of a probability gap but decreasing the probability limit from 12 to exponentially small values. We show that SBP is in the polynomial-time hierarchy, betwee
Publikováno v:
Theoretical Computer Science. 345(2-3):260-295
Given a fixed computable binary operation f, we study the complexity of the following generation problem: the input consists of strings a1, ..., an, b. The question is whether b is in the closure of {a1, ..., an} under operation f.For several subclas
Publikováno v:
ATZ - Automobiltechnische Zeitschrift. 107:882-886
Die fruhzeitige Berechnung der Betriebsfestigkeit, des Crashverhaltens, des Fahrkomforts und des akustischen Verhaltens in der virtuellen Entwicklungsphase ist ein wichtiger Baustein fur die von den Automobilherstellern geforderte Reduktion der Entwi
Publikováno v:
Information Processing Letters. 96:59-66
The complexity of various problems in connection with Boolean constraints, like, for example, quantified Boolean constraint satisfaction, have been studied recently. Depending on what types of constraints may be used, the complexity of such problems