Sciweavers

446 search results - page 83 / 90
» Who's Got the Key
Sort
View
DAM
2006
59views more  DAM 2006»
15 years 6 months ago
Optimal strategies for equal-sum dice games
In this paper we consider a non-cooperative two-person zero-sum matrix game, called dice game. In an (n, ) dice game, two players can independently choose a dice from a collection...
Bart De Schuymer, Hans De Meyer, Bernard De Baets
ENTCS
2006
134views more  ENTCS 2006»
15 years 6 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
ISJ
2008
93views more  ISJ 2008»
15 years 6 months ago
Knowledge transfer in globally distributed teams: the role of transactive memory
Abstract. This paper explores the role of transactive memory in enabling knowledge transfer between globally distributed teams. While the information systems literature has recentl...
Ilan Oshri, Paul C. van Fenema, Julia Kotlarsky
CORR
2007
Springer
133views Education» more  CORR 2007»
15 years 5 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
JACM
2006
99views more  JACM 2006»
15 years 5 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller