Sciweavers

368 search results - page 6 / 74
» Improved Online Algorithms for the Sorting Buffer Problem
Sort
View
SODA
1994
ACM
133views Algorithms» more  SODA 1994»
13 years 8 months ago
Derandomizing Algorithms for Routing and Sorting on Meshes
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
ICDAR
2009
IEEE
14 years 2 months ago
An Improved Online Tamil Character Recognition Engine Using Post-Processing Methods
We propose script-specific post processing schemes for improving the recognition rate of online Tamil characters. At the first level, features derived at each sample point of the ...
Suresh Sundaram, Angarai Ganesan Ramakrishnan
DAM
2010
79views more  DAM 2010»
13 years 7 months ago
On the sum minimization version of the online bin covering problem
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
János Csirik, Leah Epstein, Csanád I...
DAC
1997
ACM
13 years 11 months ago
Wire Segmenting for Improved Buffer Insertion
Buffer insertion seeks to place buffers on the wires of a signal net to minimize delay. Van Ginneken [14] proposed an optimal dynamic programming solution (with extensions propose...
Charles J. Alpert, Anirudh Devgan
ETFA
2006
IEEE
13 years 11 months ago
An Initial Task Assignment Method for Autonomous Distributed Vehicle Systems with Finite Buffer Capacity
This paper discusses an on-line Tasks Assignment and Routing Problem(TARP) for Autonomous Transportation Systems(ATSs) in manufacturing systems. The TARP results in a constrained ...
Yusuke Morihiro, Toshiyuki Miyamoto, Sadatoshi Kum...