Sciweavers

117 search results - page 7 / 24
» What do we know about the Metropolis algorithm
Sort
View
IJAR
2006
103views more  IJAR 2006»
13 years 7 months ago
Computing mean and variance under Dempster-Shafer uncertainty: Towards faster algorithms
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m...
Vladik Kreinovich, Gang Xiang, Scott Ferson
SP
1997
IEEE
112views Security Privacy» more  SP 1997»
13 years 11 months ago
Analyzing Consistency of Security Policies
This paper discusses the development of a methodology for reasoning about properties of security policies. We view a security policy as a special case of regulation which specifi...
Laurence Cholvy, Frédéric Cuppens
CDC
2010
IEEE
163views Control Systems» more  CDC 2010»
13 years 2 months ago
A distributed joint-learning and auction algorithm for target assignment
We consider an agent-target assignment problem in an unknown environment modeled as an undirected graph. Agents do not know this graph or the locations of the targets on it. Howeve...
Teymur Sadikhov, Minghui Zhu, Sonia Martíne...
AAAI
1990
13 years 8 months ago
Decidable Reasoning in First-Order Knowledge Bases with Perfect Introspection
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
Gerhard Lakemeyer
WWW
2006
ACM
14 years 8 months ago
Random sampling from a search engine's index
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
Ziv Bar-Yossef, Maxim Gurevich