Sciweavers

518 search results - page 70 / 104
» Beating a Random Assignment
Sort
View
INFOCOM
2009
IEEE
15 years 9 months ago
Emulation and Approximation of a Flexible Delay Line by Parallel Non-Overtaking Delay Lines
—In this paper we propose to construct an flexible delay line with maximum delay d by parallel non-overtaking delay lines. We show that for a fixed number of non-overtaking del...
Duan-Shin Lee, Kai-Jie Hsu, Cheng-Shang Chang, Jay...
108
Voted
APPROX
2009
Springer
99views Algorithms» more  APPROX 2009»
15 years 9 months ago
Resource Minimization Job Scheduling
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
Julia Chuzhoy, Paolo Codenotti
ESA
2009
Springer
142views Algorithms» more  ESA 2009»
15 years 9 months ago
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
Andreas Karrenbauer, Thomas Rothvoß
153
Voted
IJCNN
2008
IEEE
15 years 9 months ago
Dataset complexity can help to generate accurate ensembles of k-nearest neighbors
— Gene expression based cancer classification using classifier ensembles is the main focus of this work. A new ensemble method is proposed that combines predictions of a small ...
Oleg Okun, Giorgio Valentini
GLOBECOM
2007
IEEE
15 years 8 months ago
Colouring Link-Directional Interference Graphs in Wireless Ad Hoc Networks
—In this paper, we clarify inter-link interference in wireless ad-hoc networks by using link-directional interference graphs (l-graph). Most of the interference graphs in the lit...
Ping Chung Ng, David J. Edwards, Soung Chang Liew