Sciweavers

3907 search results - page 275 / 782
» Time, Knowledge, and Choice
Sort
View
REX
1993
15 years 10 months ago
Relationships Between Models of Concurrency
Abstract. Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling...
Mogens Nielsen, Vladimiro Sassone, Glynn Winskel
LICS
1998
IEEE
15 years 10 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
ICAISC
2010
Springer
15 years 8 months ago
Do We Need Whatever More Than k-NN?
Abstract. Many sophisticated classification algorithms have been proposed. However, there is no clear methodology of comparing the results among different methods. According to ou...
Miroslaw Kordos, Marcin Blachnik, Dawid Strzempa
DIM
2008
ACM
15 years 8 months ago
Quantifying the security of preference-based authentication
We describe a technique aimed at addressing longstanding problems for password reset: security and cost. In our approach, users are authenticated using their preferences. Experime...
Markus Jakobsson, Liu Yang, Susanne Wetzel
WISES
2008
15 years 8 months ago
Establishing wireless time-triggered communication using a firefly clock synchronization approach
In South-East Asia, huge swarms of fireflies synchronously emit light flashes to attract mating partners. The underlying principle can be used to implement a robust and scalable d...
Robert Leidenfrost, Wilfried Elmenreich