Sciweavers

489 search results - page 38 / 98
» A Method for Accelerating the HITS Algorithm
Sort
View
SI3D
2005
ACM
14 years 2 months ago
A general algorithm for output-sensitive visibility preprocessing
Occlusion culling based on precomputed visibility information is a standard method for accelerating the rendering in real-time graphics applications. In this paper we present a ne...
Samuli Laine
GPEM
2000
121views more  GPEM 2000»
13 years 8 months ago
Bayesian Methods for Efficient Genetic Programming
ct. A Bayesian framework for genetic programming GP is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs ...
Byoung-Tak Zhang
CEC
2007
IEEE
14 years 3 months ago
Opposition-based particle swarm algorithm with cauchy mutation
—Particle Swarm Optimization (PSO) has shown its fast search speed in many complicated optimization and search problems. However, PSO could often easily fall into local optima. T...
Hui Wang, Hui Li, Yong Liu, Changhe Li, Sanyou Y. ...
AAAI
1998
13 years 10 months ago
Boosting Combinatorial Search Through Randomization
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any tim...
Carla P. Gomes, Bart Selman, Henry A. Kautz
ESANN
2007
13 years 10 months ago
Applying the Episodic Natural Actor-Critic Architecture to Motor Primitive Learning
In this paper, we investigate motor primitive learning with the Natural Actor-Critic approach. The Natural Actor-Critic consists out of actor updates which are achieved using natur...
Jan Peters, Stefan Schaal