6894 search results - page 273 / 1379 » Generation Problems |
155
click to vote
STOC
1987
ACM
15 years 10 months ago
1987
ACM
We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
174
click to vote
TAICPART
2006
IEEE
16 years 19 days ago
2006
IEEE
The design of complex systems, e.g., telecom services, is nowadays usually based on the integration of components (COTS), loosely coupled in distributed architectures. When compon...
175
click to vote
IJCNN
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— Meta-Learning has been used to predict the performance of learning algorithms based on descriptive features of the learning problems. Each training example in this cont...
143
click to vote
AAAI
1994
15 years 8 months ago
1994
We de ne the probabilistic planning problem in terms of a probability distribution over initial world states, a boolean combination of goal propositions, a probability threshold, ...
169
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...