Sciweavers

1969 search results - page 257 / 394
» Financial Theory 1
Sort
View
SPAA
2005
ACM
14 years 3 months ago
Using elimination to implement scalable and lock-free FIFO queues
This paper shows for the first time that elimination, a scaling technique formerly applied only to counters and LIFO structures, can be applied to FIFO data structures, specific...
Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit
ATAL
2005
Springer
14 years 3 months ago
Coping with inaccurate reputation sources: experimental analysis of a probabilistic trust model
This research aims to develop a model of trust and reputation that will ensure good interactions amongst software agents in large scale open systems. The following are key drivers...
W. T. Luke Teacy, Jigar Patel, Nicholas R. Jenning...
CALCO
2005
Springer
104views Mathematics» more  CALCO 2005»
14 years 3 months ago
Abstract Scalars, Loops, and Free Traced and Strongly Compact Closed Categories
Scalars, Loops, and Free Traced and Strongly Compact Closed Categories Samson Abramsky Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, U.K. htt...
Samson Abramsky
DALT
2005
Springer
14 years 3 months ago
Resource-Bounded Belief Revision and Contraction
Agents need to be able to change their beliefs; in particular, they should be able to contract or remove a certain belief in order to restore consistency to their set of beliefs, a...
Natasha Alechina, Mark Jago, Brian Logan
FOSSACS
2005
Springer
14 years 3 months ago
Composition and Decomposition in True-Concurrency
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
Sibylle B. Fröschle