Sciweavers

388 search results - page 63 / 78
» Improving Exact Algorithms for MAX-2-SAT
Sort
View
COLT
2004
Springer
14 years 26 days ago
Concentration Bounds for Unigrams Language Model
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
Evgeny Drukh, Yishay Mansour
ISLPED
1997
ACM
114views Hardware» more  ISLPED 1997»
13 years 11 months ago
Cycle-accurate macro-models for RT-level power analysis
 In this paper we present a methodology and techniques for generating cycle-accurate macro-models for RTlevel power analysis. The proposed macro-model predicts not only...
Qinru Qiu, Qing Wu, Massoud Pedram, Chih-Shun Ding
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
13 years 11 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
AAAI
2007
13 years 9 months ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
FAST
2008
13 years 9 months ago
The RAID-6 Liberation Codes
The RAID-6 specification calls for a storage system with multiple storage devices to tolerate the failure of any two devices. Numerous erasure coding techniques have been develope...
James S. Plank