Sciweavers

359 search results - page 50 / 72
» Multi-state Directed Acyclic Graphs
Sort
View
ASPDAC
2008
ACM
93views Hardware» more  ASPDAC 2008»
15 years 1 months ago
Scheduling with integer time budgeting for low-power optimization
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
Wei Jiang, Zhiru Zhang, Miodrag Potkonjak, Jason C...
LWA
2007
15 years 1 months ago
Multi-objective Frequent Termset Clustering
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
Andreas Kaspari, Michael Wurst
101
Voted
FAST
2009
14 years 9 months ago
HYDRAstor: A Scalable Secondary Storage
HYDRAstor is a scalable, secondary storage solution aimed at the enterprise market. The system consists of a back-end architectured as a grid of storage nodes built around a distr...
Cezary Dubnicki, Leszek Gryz, Lukasz Heldt, Michal...
135
Voted
BMCBI
2011
14 years 6 months ago
A lightweight, flow-based toolkit for parallel and distributed bioinformatics pipelines
Background: Bioinformatic analyses typically proceed as chains of data-processing tasks. A pipeline, or ‘workflow’, is a well-defined protocol, with a specific structure defin...
Marcin Cieslik, Cameron Mura
INFOCOM
2005
IEEE
15 years 5 months ago
Link scheduling in sensor networks: distributed edge coloring revisited
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash