Sciweavers

20294 search results - page 160 / 4059
» Algorithmic Information Theory
Sort
View
129
Voted
REX
1991
15 years 8 months ago
The Theory of Timed Automata
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...
Rajeev Alur, David L. Dill
BIRTHDAY
2008
Springer
15 years 5 months ago
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...
Alexander Rabinovich, Amit Shomrat
CAD
2007
Springer
15 years 4 months ago
Detection of closed sharp edges in point clouds using normal estimation and graph theory
The reconstruction of a surface model from a point cloud is an important task in the reverse engineering of industrial parts. We aim at constructing a curve network on the point c...
Kris Demarsin, Denis Vanderstraeten, Tim Volodine,...
AMC
2011
14 years 8 months ago
Ruin theory with excess of loss reinsurance and reinstatements
The present paper studies the probability of ruin of an insurer, if excess of loss reinsurance with reinstatements is applied. In the setting of the classical CramerLundberg risk ...
Hansjörg Albrecher, Sandra Haas
APAL
2006
73views more  APAL 2006»
15 years 4 months ago
On the parallel between the suplattice and preframe approaches to locale theory
This paper uses the locale theory approach to topology. Two descriptions are given of all locale limits, the first description using suplattice constructions and the second prefra...
Christopher F. Townsend