Sciweavers

1921 search results - page 33 / 385
» Making AC-3 an Optimal Algorithm
Sort
View
GECCO
2003
Springer
245views Optimization» more  GECCO 2003»
14 years 25 days ago
A Non-dominated Sorting Particle Swarm Optimizer for Multiobjective Optimization
Abstract. This paper introduces a modified PSO, Non-dominated Sorting Particle Swarm Optimizer (NSPSO), for better multiobjective optimization. NSPSO extends the basic form of PSO...
Xiaodong Li
AOR
2010
13 years 5 months ago
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
Brian C. Dean
GECCO
2006
Springer
447views Optimization» more  GECCO 2006»
13 years 11 months ago
Candlestick stock analysis with genetic algorithms
Candlestick analysis, a form of stock market technical analysis, is well suited for use with a genetic search algorithm. This paper explores an implementation of marrying these tw...
Peter Belford
IJCNN
2007
IEEE
14 years 1 months ago
Optimizing 0/1 Loss for Perceptrons by Random Coordinate Descent
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
Ling Li, Hsuan-Tien Lin
ACL
2009
13 years 5 months ago
K-Best A* Parsing
A parsing makes 1-best search efficient by suppressing unlikely 1-best items. Existing kbest extraction methods can efficiently search for top derivations, but only after an exhau...
Adam Pauls, Dan Klein