Sciweavers

2110 search results - page 93 / 422
» What is the complexity of a distributed computing system
Sort
View
ATAL
2005
Springer
15 years 9 months ago
An online POMDP algorithm for complex multiagent environments
In this paper, we present an online method for POMDPs, called RTBSS (Real-Time Belief Space Search), which is based on a look-ahead search to find the best action to execute at e...
Sébastien Paquet, Ludovic Tobin, Brahim Cha...
KER
2008
193views more  KER 2008»
15 years 4 months ago
The 1st international workshop on computational social choice
Computational social choice is a new discipline currently emerging at the interface of social choice theory and computer science. It is concerned with the application of computati...
Ulle Endriss
ISSA
2008
15 years 5 months ago
Immune System Based Intrusion Detection System
The threats and intrusions in IT systems can basically be compared to human diseases with the difference that the human body has an effective way to deal with them, what still nee...
Christoph Ehret, Ulrich Ultes-Nitsche
AFRIGRAPH
2007
ACM
15 years 8 months ago
Generic computation of bulletin boards into geometric kernels
Nowadays, many commercial CAD systems are built on proprietary geometric kernels which provide an API containing a set of high level geometric operations (boolean operations, slot...
Mehdi Baba-ali, David Marcheix, Xavier Skapin, Yve...
VOSS
2004
Springer
135views Mathematics» more  VOSS 2004»
15 years 9 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