Sciweavers

2372 search results - page 149 / 475
» Probabilistic calling context
Sort
View
VOSS
2004
Springer
135views Mathematics» more  VOSS 2004»
15 years 7 months ago
Analysing Randomized Distributed Algorithms
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
Gethin Norman
CSFW
2003
IEEE
15 years 7 months ago
Anonymity and Information Hiding in Multiagent Systems
We provide a framework for reasoning about information-hiding requirements in multiagent systems and for reasoning about anonymity in particular. Our framework employs the modal l...
Joseph Y. Halpern, Kevin R. O'Neill
GECCO
2003
Springer
111views Optimization» more  GECCO 2003»
15 years 7 months ago
Evolutionary Computing as a Tool for Grammar Development
Abstract. In this paper, an agent-based evolutionary computing technique is introduced, that is geared towards the automatic induction and optimization of grammars for natural lang...
Guy De Pauw
SIGCSE
2000
ACM
193views Education» more  SIGCSE 2000»
15 years 6 months ago
Experimentation with bounded buffer synchronization
Undergraduates are usually introduced to synchronization in operating systems through a discussion of classical problems such as reader-writer or producers-consumers. The traditio...
Steven Robbins
ANSS
1997
IEEE
15 years 6 months ago
Performance Issues of Task Routing and Task Scheduling with Resequencing in Homogeneous Distributed Systems
An important part of a distributed system design is the workload sharing among the processors. This includes partitioningthe arriving jobs into tasks that can be executed in paral...
Anthony Karageorgos, Helen D. Karatza