Sciweavers

1186 search results - page 11 / 238
» Improving Random Walk Performance
Sort
View
CIKM
2005
Springer
14 years 3 months ago
Query expansion using random walk models
It has long been recognized that capturing term relationships is an important aspect of information retrieval. Even with large amounts of data, we usually only have significant ev...
Kevyn Collins-Thompson, Jamie Callan
IROS
2007
IEEE
168views Robotics» more  IROS 2007»
14 years 4 months ago
Improving humanoid locomotive performance with learnt approximated dynamics via Gaussian processes for regression
Abstract— We propose to improve the locomotive performance of humanoid robots by using approximated biped stepping and walking dynamics with reinforcement learning (RL). Although...
Jun Morimoto, Christopher G. Atkeson, Gen Endo, Go...
TC
2008
13 years 9 months ago
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
Ming Zhong, Kai Shen, Joel I. Seiferas
SAT
2005
Springer
95views Hardware» more  SAT 2005»
14 years 3 months ago
Random Walk with Continuously Smoothed Variable Weights
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
Steven David Prestwich
FOCS
2003
IEEE
14 years 3 months ago
Learning DNF from Random Walks
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell,...