Sciweavers

2899 search results - page 411 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 9 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
SPAA
2010
ACM
15 years 5 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
BMCBI
2011
14 years 9 months ago
Smith-Waterman Peak Alignment for Comprehensive Two-dimensional Gas Chromatography Mass Spectrometry
Background: Comprehensive two-dimensional gas chromatography coupled with mass spectrometry (GC × GCMS) is a powerful technique which has gained increasing attention over the las...
Seongho Kim, Imhoi Koo, Aiqin Fang, Xiang Zhang
VLSID
2007
IEEE
206views VLSI» more  VLSID 2007»
16 years 5 months ago
MAX: A Multi Objective Memory Architecture eXploration Framework for Embedded Systems-on-Chip
Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and l...
T. S. Rajesh Kumar, C. P. Ravikumar, R. Govindaraj...
ATAL
2006
Springer
15 years 9 months ago
Integrating parallel interactions into cooperative search
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
Efrat Manisterski, David Sarne, Sarit Kraus