3758 search results - page 346 / 752 » A Complete Subsumption Algorithm |
144
click to vote
COLT
2003
Springer
15 years 12 months ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
182
click to vote
ICDCSW
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared key. Due to the dynamic nature of these ...
154
click to vote
ISCA
2000
IEEE
15 years 11 months ago
2000
IEEE
Spatial-lattice computations with finite-range interactions are an important class of easily parallelized computations. This class includes many simple and direct algorithms for ...
173
click to vote
ICFP
1999
ACM
15 years 11 months ago
1999
ACM
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...
198
click to vote
PKDD
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. In many applications of data mining a - sometimes considerable - part of the data values is missing. This may occur because the data values were simply never entered into...