Sciweavers

2882 search results - page 237 / 577
» Enhancements to the Voting Algorithm
Sort
View
178
Voted
PARA
2004
Springer
15 years 10 months ago
Speeding up Parallel Graph Coloring
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woo...
120
Voted
SBIA
2004
Springer
15 years 10 months ago
Heuristically Accelerated Q-Learning: A New Approach to Speed Up Reinforcement Learning
This work presents a new algorithm, called Heuristically Accelerated Q–Learning (HAQL), that allows the use of heuristics to speed up the well-known Reinforcement Learning algori...
Reinaldo A. C. Bianchi, Carlos H. C. Ribeiro, Anna...
MCS
2001
Springer
15 years 9 months ago
Automatic Model Selection in a Hybrid Perceptron/Radial Network
We provide several enhancements to our previously introduced algorithm for a sequential construction of a hybrid network of radial and perceptron hidden units [6]. At each stage, ...
Shimon Cohen, Nathan Intrator
177
Voted
CG
2006
Springer
15 years 8 months ago
A Skat Player Based on Monte-Carlo Simulation
We apply Monte Carlo simulation and alpha-beta search to the card game of Skat, which is similar to Bridge, but different enough to require some new algorithmic ideas besides the t...
Sebastian Kupferschmid, Malte Helmert
CP
2006
Springer
15 years 8 months ago
Global Optimization of Probabilistically Constrained Linear Programs
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
Shabbir Ahmed