Sciweavers

15485 search results - page 186 / 3097
» Computing Optimal Subsets
Sort
View
TON
2012
13 years 8 months ago
A Game-Theoretic Approach to Anonymous Networking
—Anonymous wireless networking is studied when an adversary monitors the transmission timing of an unknown subset of the network nodes. For a desired quality of service (QoS), as...
Parvathinathan Venkitasubramaniam, Lang Tong
CADE
2009
Springer
16 years 7 months ago
Does This Set of Clauses Overlap with at Least One MUS?
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...
Éric Grégoire, Bertrand Mazure, C&ea...
ECSQARU
1997
Springer
15 years 10 months ago
Creating Prototypes for Fast Classification in Dempster-Shafer Clustering
We develop a classification method for incoming pieces of evidence in Dempster-Shafer theory. This methodology is based on previous work with clustering and specification of origin...
Johan Schubert
AAAI
2010
15 years 6 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman