Sciweavers

971 search results - page 100 / 195
» Approximate Satisfiability and Equivalence
Sort
View
94
Voted
IJCAI
1989
15 years 1 months ago
Execution Architectures and Compilation
This paper introduces a partition of the possible forms of knowledge according to their rela­ tionship to the basic objective of an intelligent agent, namely to act successfully ...
Stuart J. Russell
DAM
2008
135views more  DAM 2008»
15 years 25 days ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
116
Voted
ENTCS
2006
118views more  ENTCS 2006»
15 years 23 days ago
An Operational Domain-theoretic Treatment of Recursive Types
We develop a domain theory for treating recursive types with respect to contextual equivalence. The principal approach taken here deviates from classical domain theory in that we ...
Weng Kin Ho
111
Voted
ENTCS
2006
151views more  ENTCS 2006»
15 years 23 days ago
Stochastic Simulation Methods Applied to a Secure Electronic Voting Model
We demonstrate a novel simulation technique for analysing large stochastic process algebra models, applying this to a secure electronic voting system example. By approximating the...
Jeremy T. Bradley, Stephen T. Gilmore
IJISEC
2008
119views more  IJISEC 2008»
15 years 22 days ago
Estimating the maximum information leakage
Preventing improper information leaks is a greatest challenge of the modern society. In this paper we present a technique for measuring the ability of several families of adversari...
Alessandro Aldini, Alessandra Di Pierro