Sciweavers

1795 search results - page 158 / 359
» Search by strategy
Sort
View
CP
2010
Springer
15 years 5 months ago
Heuristics for Planning with SAT
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
Jussi Rintanen
TEC
2008
94views more  TEC 2008»
15 years 6 months ago
Measuring Generalization Performance in Coevolutionary Learning
Coevolutionary learning involves a training process where training samples are instances of solutions that interact strategically to guide the evolutionary (learning) process. One ...
Siang Yew Chong, Peter Tino, Xin Yao
SAT
2004
Springer
131views Hardware» more  SAT 2004»
15 years 12 months ago
A Comparative Study of 2QBF Algorithms
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
Darsh P. Ranjan, Daijue Tang, Sharad Malik
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
15 years 11 months ago
Benchmarking the NEWUOA on the BBOB-2009 function testbed
The NEWUOA which belongs to the class of Derivative-Free optimization algorithms is benchmarked on the BBOB-2009 noisefree testbed. A multistart strategy is applied with a maximum...
Raymond Ros
IGARSS
2010
15 years 4 months ago
Spatial preprocessing for endmember extraction using unsupervised clustering and orthogonal subspace projection concepts
In this paper, we develop a new spatial preprocessing strategy which can be applied prior to a spectral-based endmember extraction process for unmixing of hyperspectral data. Our ...
Gabriel Martin, Antonio J. Plaza