2434 search results - page 38 / 487 » Algorithmic Randomness of Closed Sets |
122
click to vote
ESA
2005
Springer
15 years 7 months ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
180
Voted
AAAI
2011
14 years 1 months ago
2011
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
TPHOL
2003
IEEE
15 years 7 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
115
Voted
ADHOCNOW
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio sta...
126
click to vote
ICOIN
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...