Sciweavers

9405 search results - page 362 / 1881
» Computing a Model of Set Theory
Sort
View
IPPS
2009
IEEE
16 years 27 days ago
A fusion-based approach for tolerating faults in finite state machines
Given a set of n different deterministic finite state machines (DFSMs) modeling a distributed system, we examine the problem of tolerating f crash or Byzantine faults in such a ...
Vinit A. Ogale, Bharath Balasubramanian, Vijay K. ...
EWHCI
1993
15 years 10 months ago
Applying the Wizard of Oz Technique to the Study of Multimodal Systems
The Wizard of Oz (WOz) technique is an experimental evaluation mechanism. It allows the observation of a user operating an apparently fully functioning system whose missing service...
Daniel Salber, Joëlle Coutaz
ATAL
2010
Springer
15 years 7 months ago
Ants meeting algorithms
Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ...
Asaf Shiloni, Alon Levy, Ariel Felner, Meir Kalech
ICFP
2010
ACM
15 years 7 months ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao
ISF
2008
114views more  ISF 2008»
15 years 6 months ago
An OVAL-based active vulnerability assessment system for enterprise computer networks
Abstract Many security problems are caused by vulnerabilities hidden in enterprise computer networks. It is very important for system administrators to have knowledge about the sec...
Xiuzhen Chen, Qinghua Zheng, Xiaohong Guan