Sciweavers

3433 search results - page 113 / 687
» Heuristics for a bidding problem
Sort
View
STACS
2005
Springer
15 years 12 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
SAT
2004
Springer
89views Hardware» more  SAT 2004»
15 years 11 months ago
Using Rewarding Mechanisms for Improving Branching Heuristics
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewa...
Elsa Carvalho, João P. Marques Silva
ICLP
2010
Springer
15 years 10 months ago
Learning Domain-Specific Heuristics for Answer Set Solvers
In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search al...
Marcello Balduccini
ECAI
2006
Springer
15 years 10 months ago
Phonetic Spelling and Heuristic Search
Abstract. We introduce a new approach to spellchecking for languages with extreme phonetic irregularities. The spelling for such languages can be significantly improved if knowledg...
Benno Stein, Daniel Curatolo
CSB
2005
IEEE
132views Bioinformatics» more  CSB 2005»
15 years 8 months ago
A Fast Shotgun Assembly Heuristic
Genome sequencing opened a new era in genetics allowing the study of genomes at the nucleotide level. However, the chosen method of sequencing produced large numbers of nucleotide...
Christopher Wilks, Sami Khuri