Sciweavers

35 search results - page 6 / 7
» Scheduling flows with unknown sizes: approximate analysis
Sort
View
ICALP
2004
Springer
13 years 11 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
CNSR
2008
IEEE
155views Communications» more  CNSR 2008»
14 years 21 days ago
Detecting Network Anomalies Using Different Wavelet Basis Functions
Signal processing techniques have been applied recently for analyzing and detecting network anomalies due to their potential to find novel or unknown intrusions. In this paper, we...
Wei Lu, Mahbod Tavallaee, Ali A. Ghorbani
EMSOFT
2008
Springer
13 years 8 months ago
Energy efficient streaming applications with guaranteed throughput on MPSoCs
In this paper we present a design space exploration flow to achieve energy efficiency for streaming applications on MPSoCs while meeting the specified throughput constraints. The ...
Jun Zhu, Ingo Sander, Axel Jantsch
BMCBI
2007
128views more  BMCBI 2007»
13 years 6 months ago
Combining classifiers to predict gene function in Arabidopsis thaliana using large-scale gene expression measurements
Background: Arabidopsis thaliana is the model species of current plant genomic research with a genome size of 125 Mb and approximately 28,000 genes. The function of half of these ...
Hui Lan, Rachel Carson, Nicholas J. Provart, Antho...
WIOPT
2011
IEEE
12 years 10 months ago
Network utility maximization over partially observable Markovian channels
Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...
Chih-Ping Li, Michael J. Neely