Sciweavers

2244 search results - page 66 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
NIPS
2007
15 years 7 months ago
Theoretical Analysis of Heuristic Search Methods for Online POMDPs
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
Stéphane Ross, Joelle Pineau, Brahim Chaib-...
WSC
1997
15 years 7 months ago
New Development of Optimal Computing Budget Allocation for Discrete Event Simulation
This paper deals with ranking and selection problem via simulation. We present an optimal computing budget allocation technique which can select the best of k simulated designs. T...
Hsiao-Chang Chen, Chun-Hung Chen, Liyi Dai, Enver ...
SADM
2008
178views more  SADM 2008»
15 years 5 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
PPSN
2004
Springer
15 years 11 months ago
An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem
Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairw...
Gabriele Koller, Günther R. Raidl
ICGA
1997
89views Optimization» more  ICGA 1997»
15 years 7 months ago
A Wave Analysis of the Subset Sum Problem
This paper introduces the wave model, a novel approach on analyzing the behavior of GAs. Our aim is to give techniques that have practical relevance and provide tools for improvin...
Márk Jelasity