Sciweavers

79 search results - page 5 / 16
» A Basic Characterization of Relation Migration
Sort
View
POPL
2006
ACM
14 years 7 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
HICSS
1996
IEEE
123views Biometrics» more  HICSS 1996»
13 years 11 months ago
Concurrency: A Case Study in Remote Tasking and Distributed IPC
Remote tasking encompasses different functionality, such as remote forking, multiple remote spawning, and task migration. In order to overcome the relatively high costs of these m...
Dejan S. Milojicic, Alan Langerman, David L. Black...
APAL
2006
73views more  APAL 2006»
13 years 7 months ago
Compactness in locales and in formal topology
If a locale is presented by a "flat site", it is shown how its frame can be presented by generators and relations as a dcpo. A necessary and sufficient condition is deri...
Steven J. Vickers
COMMA
2010
13 years 2 months ago
Generalizing stable semantics by preferences
Different proposals have been made in the literature for refining Dung's argumentation framework by preferences between arguments. The idea is to ignore an attack if the atta...
Leila Amgoud, Srdjan Vesic
ISIPTA
2003
IEEE
130views Mathematics» more  ISIPTA 2003»
14 years 19 days ago
Some Results on Generalized Coherence of Conditional Probability Bounds
Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional p...
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo