Sciweavers

2252 search results - page 154 / 451
» Improving Random Forests
Sort
View
CIG
2005
IEEE
14 years 1 months ago
Combining Tactical Search and Monte-Carlo in the Game of Go
We present a way to integrate search and Monte-Carlo methods in the game of Go. Our program uses search to find the status of tactical goals, builds groups, selects interesting go...
Tristan Cazenave, Bernard Helmstetter
SAT
2005
Springer
162views Hardware» more  SAT 2005»
14 years 1 months ago
Heuristics for Fast Exact Model Counting
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
Tian Sang, Paul Beame, Henry A. Kautz
IPTPS
2003
Springer
14 years 1 months ago
A Simple Fault Tolerant Distributed Hash Table
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
Moni Naor, Udi Wieder
AAIM
2006
Springer
143views Algorithms» more  AAIM 2006»
14 years 2 months ago
A Compression-Boosting Transform for Two-Dimensional Data
We introduce a novel invertible transform for two-dimensional data which has the objective of reordering the matrix so it will improve its (lossless) compression at later stages. T...
Qiaofeng Yang, Stefano Lonardi, Avraham Melkman
DASFAA
2005
IEEE
141views Database» more  DASFAA 2005»
14 years 1 months ago
Learning Tree Augmented Naive Bayes for Ranking
Naive Bayes has been widely used in data mining as a simple and effective classification algorithm. Since its conditional independence assumption is rarely true, numerous algorit...
Liangxiao Jiang, Harry Zhang, Zhihua Cai, Jiang Su