401 search results - page 48 / 81 » Random Early Marking |
JAIR
2000
15 years 8 days ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
113
Voted
BMCBI
2004
15 years 10 days ago
2004
Background: Recently, mass spectrometry data have been mined using a genetic algorithm to produce discriminatory models that distinguish healthy individuals from those with cancer...
103
click to vote
ICIP
2008
IEEE
16 years 2 months ago
2008
IEEE
In this paper, we propose a series of techniques to enhance the computational performance of existing Belief Propagation (BP) based stereo matching that relies on automatic estima...
DAC
2007
ACM
16 years 1 months ago
2007
ACM
We present an efficient technique for finding the mean and variance of the full-chip leakage of a candidate design, while considering logic-structures and both die-to-die and with...
74
Voted
WWW
2006
ACM
16 years 1 months ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...