1647 search results - page 146 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
142
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
145
click to vote
JCC
2008
15 years 5 months ago
2008
: We adapt a combinatorial optimization algorithm, extremal optimization (EO), for the search problem in computational protein design. This algorithm takes advantage of the knowled...
168
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
142
Voted
AAAI
1997
15 years 6 months ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
144
Voted
SIAMNUM
2010
14 years 11 months ago
2010
Abstract. We introduce hybridization and postprocessing techniques for the RaviartThomas approximation of second-order elliptic eigenvalue problems. Hybridization reduces the Ravia...