Sciweavers

724 search results - page 24 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
ICML
2009
IEEE
16 years 16 days ago
Bandit-based optimization on graphs with application to library performance tuning
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
Arpad Rimmel, Frédéric de Mesmay, Ma...
ICCAD
2009
IEEE
151views Hardware» more  ICCAD 2009»
14 years 9 months ago
GREMA: Graph reduction based efficient mask assignment for double patterning technology
Double patterning technology (DPT) has emerged as the most hopeful candidate for the next technology node of the ITRS roadmap [1]. The goal of a DPT decomposer is to decompose the...
Yue Xu, Chris Chu
CC
2006
Springer
108views System Software» more  CC 2006»
15 years 3 months ago
A Fresh Look at PRE as a Maximum Flow Problem
We show that classic PRE is also a maximum flow problem, thereby revealing the missing link between classic and speculative PRE, and more importantly, establishing a common high-le...
Jingling Xue, Jens Knoop
MOBIHOC
2002
ACM
15 years 11 months ago
Minimum energy paths for reliable communication in multi-hop wireless networks
Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has...
Suman Banerjee, Archan Misra
TELSYS
2008
114views more  TELSYS 2008»
14 years 11 months ago
Efficient probe selection algorithms for fault diagnosis
Increase in the network usage for more and more performance critical applications has caused a demand for tools that can monitor network health with minimum management traffic. Ada...
Maitreya Natu, Adarshpal S. Sethi, Errol L. Lloyd