Sciweavers

2266 search results - page 277 / 454
» Some Solutions to the Ignoring Problem
Sort
View
AAAI
2006
15 years 8 months ago
Cost-Optimal External Planning
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
Stefan Edelkamp, Shahid Jabbar
DAGSTUHL
2006
15 years 8 months ago
Probabilistically Stable Numerical Sparse Polynomial Interpolation
We consider the problem of sparse interpolation of a multivariate black-box polynomial in floating-point arithmetic. That is, both the inputs and outputs of the black-box polynomia...
Mark Giesbrecht, George Labahn, Wen-shin Lee
IJIT
2004
15 years 8 months ago
Restartings: A Technique to Improve Classic Genetic Algorithms' Performance
In this contribution, a way to enhance the performance of the classic Genetic Algorithm is proposed. The idea of restarting a Genetic Algorithm is applied in order to obtain better...
Grigorios N. Beligiannis, Georgios A. Tsirogiannis...
HIS
2003
15 years 8 months ago
On the Performance of Ant-based Clustering
Ant-based clustering and sorting is a nature-inspired heuristic for general clustering tasks. It has been applied variously, from problems arising in commerce, to circuit design, t...
Julia Handl, Joshua D. Knowles, Marco Dorigo
IJCAI
2003
15 years 8 months ago
A Maximal Tractable Class of Soft Constraints
Many optimization problems can be expressed us­ ing some form of soft constraints, where different measures of desirability arc associated with differ­ ent combinations of domai...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...