Sciweavers

73 search results - page 1 / 15
» An Improved Algorithm for Online Unit Clustering
Sort
View
COCOON
2007
Springer
15 years 1 months ago
An Improved Algorithm for Online Unit Clustering
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
Hamid Zarrabi-Zadeh, Timothy M. Chan
SWAT
2010
Springer
282views Algorithms» more  SWAT 2010»
15 years 2 months ago
Better Bounds on Online Unit Clustering
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
Martin R. Ehmsen, Kim S. Larsen
WAOA
2007
Springer
104views Algorithms» more  WAOA 2007»
15 years 3 months ago
On the Online Unit Clustering Problem
We continue the study of the online unit clustering problem, introduced by Chan and Zarrabi-Zadeh
Leah Epstein, Rob van Stee
AOR
2007
107views more  AOR 2007»
14 years 9 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...
VLSID
2007
IEEE
154views VLSI» more  VLSID 2007»
15 years 9 months ago
Application Specific Datapath Extension with Distributed I/O Functional Units
Performance of an application can be improved through augmenting the processor with Application specific Functional Units (AFUs). Usually a cluster of operations identified from th...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul