نتایج جستجو برای: stephan problem

تعداد نتایج: 881413  

Journal: :Zeitschrift der Savigny-Stiftung für Rechtsgeschichte: Germanistische Abteilung 2020

1998
Michael Taksar

We consider a model of a nancial corporation which has to nd an optimal policy balancing its risk and expected proots. The example treated in this paper is related to an insurance company with the risk control method known in the industry as excess-of-loss reinsurance. Under this scheme the insurance company divert part of its premium stream to another company in exchange of an obligation to pi...

2013
Stephan Schulz

E is a theorem prover for full first-order logic with equality. It reduces first-order problems to clause normal form and employs a saturation algorithm based on the equational superposition calculus. E is built on shared terms with cached rewriting, and employs several innovations for efficient clause indexing. Major strengths of the system are automatic problem analysis and highly flexible se...

2006
C. Kevin Xu

Stephan’s Quintet (SQ), discovered more than 100 years ago, is the most famous and well studied compact galaxy group. It has been observed in almost all wavebands, with the most advanced instruments including Spitzer, GALEX, HST, Chandra, VLA, and various large mm/submm telescopes/arrays such as the IRAM 30m and BIMA. The rich multi-band data reveal one of the most fascinating pictures in the u...

2011
Stephan van Staden Cristiano Calcagno Bertrand Meyer

Freefinement is an algorithm that constructs a sound refinement calculus from a verification system under certain conditions. In this paper, a verification system is any formal system for establishing whether an inductively defined term, typically a program, satisfies a specification. Examples of verification systems include Hoare logics and type systems. Freefinement first extends the term lan...

2003
Stephan Merz S. Merz

TLA+ is a language intended for the high-level specification of reactive, distributed, and in particular asynchronous systems. Combining the linear-time temporal logic TLA and classical set-theory, it provides an expressive specification formalism and supports assertional verification.

2002
Stephan Wong Sorin Cotofana

This paper describes the some relevant issues encountered by the authors during the development and teaching of an embedded system (ES) course meant for third year Electrical Engineering Bachelor students at the Faculty of Information Technology and Systems, Delft University of Technology, The Netherlands. Given that we were addressing Electrical Engineering students, we deviated from the “trad...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید