Sciweavers

2244 search results - page 41 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
HEURISTICS
2006
120views more  HEURISTICS 2006»
15 years 6 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
ICGI
1998
Springer
15 years 10 months ago
A Stochastic Search Approach to Grammar Induction
This paper describes a new sampling-based heuristic for tree search named SAGE and presents an analysis of its performance on the problem of grammar induction. This last work has b...
Hugues Juillé, Jordan B. Pollack
UAI
2004
15 years 7 months ago
Heuristic Search Value Iteration for POMDPs
We present a novel POMDP planning algorithm called heuristic search value iteration (HSVI). HSVI is an anytime algorithm that returns a policy and a provable bound on its regret w...
Trey Smith, Reid G. Simmons
MP
1998
109views more  MP 1998»
15 years 5 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
132
Voted
EVOW
2005
Springer
15 years 11 months ago
Population Training Heuristics
This work describes a new way of employing problem-specific heuristics to improve evolutionary algorithms: the Population Training Heuristic (PTH). The PTH employs heuristics in ...
Alexandre César Muniz de Oliveira, Luiz Ant...