Sciweavers

3208 search results - page 299 / 642
» A Lower Bound for Primality
Sort
View
JCO
2007
100views more  JCO 2007»
15 years 6 months ago
Semi-online scheduling with "end of sequence" information
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
Leah Epstein, Deshi Ye
CORR
2002
Springer
86views Education» more  CORR 2002»
15 years 6 months ago
Small Strictly Convex Quadrilateral Meshes of Point Sets
In this paper we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we sh...
David Bremner, Ferran Hurtado, Suneeta Ramaswami, ...
ML
2002
ACM
121views Machine Learning» more  ML 2002»
15 years 6 months ago
Near-Optimal Reinforcement Learning in Polynomial Time
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
Michael J. Kearns, Satinder P. Singh
ORDER
2002
107views more  ORDER 2002»
15 years 6 months ago
Order Dimension, Strong Bruhat Order and Lattice Properties for Posets
We determine the order dimension of the strong Bruhat order on finite Coxeter groups of types A, B and H. The order dimension is determined using a generalization of a theorem of D...
Nathan Reading
SAC
2002
ACM
15 years 6 months ago
On optimal temporal locality of stencil codes
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...
Claudia Leopold