Sciweavers

2636 search results - page 173 / 528
» Linear Programming
Sort
View
111
Voted
SAC
2004
ACM
15 years 7 months ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer
ISLPED
2003
ACM
85views Hardware» more  ISLPED 2003»
15 years 7 months ago
ILP-based optimization of sequential circuits for low power
The power consumption of a sequential circuit can be reduced by decomposing it into subcircuits which can be turned off when inactive. Power can also be reduced by careful state e...
Feng Gao, John P. Hayes
STOC
1999
ACM
132views Algorithms» more  STOC 1999»
15 years 6 months ago
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
Kevin D. Wayne
GRID
2006
Springer
15 years 2 months ago
Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the Grid
One of the first motivations of using grids comes from applications managing large data sets in field such as high energy physics or life sciences. To improve the global throughput...
Frederic Desprez, Antoine Vernois
COR
2007
108views more  COR 2007»
15 years 2 months ago
A hub location problem with fully interconnected backbone and access networks
This paper considers the design of two-layered fully interconnected networks.A two-layered network consists of clusters of nodes, each defining an access network and a backbone n...
Tommy Thomadsen, Jesper Larsen