15073 search results - page 331 / 3015 » Probabilistic algorithms for computing resultants |
130
click to vote
FOCS
1994
IEEE
15 years 9 months ago
1994
IEEE
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
127
click to vote
ICLP
2003
Springer
15 years 10 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
153
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
142
Voted
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...
196
click to vote
STOC
1999
ACM
15 years 9 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...