Sciweavers

3229 search results - page 373 / 646
» Mixing
Sort
View
DAM
1999
132views more  DAM 1999»
15 years 6 months ago
Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
Giovanni Righini, Marco Trubian
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
MOC
2002
128views more  MOC 2002»
15 years 6 months ago
Each averaging technique yields reliable a posteriori error control in FEM on unstructured grids. Part II: Higher order FEM
Averaging techniques are popular tools in adaptive finite element methods since they provide efficient a posteriori error estimates by a simple postprocessing. In the second paper ...
Sören Bartels, Carsten Carstensen
PC
1998
196views Management» more  PC 1998»
15 years 6 months ago
DataExchange: High Performance Communications in Distributed Laboratories
Current communications tools and libraries for high performance computing are designed for platforms and applications that exhibit relatively stable computational and communicatio...
Greg Eisenhauer, Beth Plale, Karsten Schwan
PRL
2002
104views more  PRL 2002»
15 years 6 months ago
Writer adaptation techniques in HMM based Off-Line Cursive Script Recognition
This work presents the application of HMM adaptation techniques to the problem of Off-Line Cursive Script Recognition. Rather than training a new model for each writer, one first ...
Alessandro Vinciarelli, Samy Bengio