Sciweavers

17329 search results - page 215 / 3466
» Improved non-approximability results
Sort
View
WSC
1997
13 years 11 months ago
Descriptive Sampling: An Improvement over Latin Hypercube Sampling
Descriptive Sampling (DS), a Monte Carlo sampling technique based on a deterministic selection of the input values and their random permutation, represents a deep conceptual chang...
Eduardo Saliby
AAAI
1996
13 years 11 months ago
Improving Case Retrieval by Remembering Questions
This paper discusses techniques that improve the performance of a case retrieval system, after it is deployed, as a result of the continued usage of the system, by remembering pre...
Richard Alterman, Daniel Griffin
AAAI
1996
13 years 11 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter
AAAI
1994
13 years 11 months ago
Noise Strategies for Improving Local Search
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
Bart Selman, Henry A. Kautz, Bram Cohen
ICASSP
2010
IEEE
13 years 10 months ago
An improved consensus-like method for Minimum Bayes Risk decoding and lattice combination
In this paper we describe a method for Minimum Bayes Risk decoding for speech recognition. This is a technique similar to Consensus a.k.a. Confusion Network Decoding, in which we ...
Haihua Xu, Daniel Povey, Lidia Mangu, Jie Zhu