Sciweavers

3190 search results - page 34 / 638
» cans 2011
Sort
View
71
Voted
JSYML
2011
89views more  JSYML 2011»
14 years 11 days ago
Forcing properties of ideals of closed sets
With every σ-ideal I on a Polish space we associate the σ-ideal I∗ generated by the closed sets in I. We study the forcing notions of Borel sets modulo the respective σ-ideals...
Marcin Sabok, Jindrich Zapletal
LR
2011
108views more  LR 2011»
14 years 11 days ago
Modeling production networks with discrete processes by means of communities of autonomous units
Abstract Communities of autonomous units are devices for the visual modeling of interactive logistic processes. The framework is founded on rule-based graph transformation and allo...
Hans-Jörg Kreowski, Sabine Kuske, Caroline vo...
OKCON
2011
39views more  OKCON 2011»
14 years 10 days ago
Paragogy
This paper describes a new theory of peer-to-peer learning and teaching that we call paragogy. Paragogy's principles were developed by adapting the Knowles's principles...
Joseph Corneli, Charles Jeffrey Danoff
66
Voted
SIAMFM
2011
72views more  SIAMFM 2011»
14 years 10 days ago
Robust Hedging of Double Touch Barrier Options
We consider model-free pricing of digital options, which pay out if the underlying asset has crossed both upper and lower barriers. We make only weak assumptions about the underly...
A. M. G. Cox, Jan Obloj
CPP
2011
98views more  CPP 2011»
13 years 9 months ago
Automatically Verifying Typing Constraints for a Data Processing Language
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
Michael Backes, Catalin Hritcu, Thorsten Tarrach