Sciweavers

7796 search results - page 1180 / 1560
» On Generalized Schur Numbers
Sort
View
ECCC
2000
140views more  ECCC 2000»
15 years 7 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
JACM
2000
86views more  JACM 2000»
15 years 7 months ago
Periodification scheme: constructing sorting networks with constant period
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oes...
KAIS
2000
87views more  KAIS 2000»
15 years 7 months ago
An Index Structure for Data Mining and Clustering
Abstract. In this paper we present an index structure, called MetricMap, that takes a set of objects and a distance metric and then maps those objects to a k-dimensional space in s...
Xiong Wang, Jason Tsong-Li Wang, King-Ip Lin, Denn...
ML
2000
ACM
15 years 7 months ago
Maximizing Theory Accuracy Through Selective Reinterpretation
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
Shlomo Argamon-Engelson, Moshe Koppel, Hillel Walt...
MST
2000
57views more  MST 2000»
15 years 7 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
« Prev « First page 1180 / 1560 Last » Next »