4229 search results - page 126 / 846 » On the Optimality of Spiral Search |
105
click to vote
IJCAI
2007
15 years 2 months ago
2007
We investigate search problems under risk in statespace graphs, with the aim of finding optimal paths for risk-averse agents. We consider problems where uncertainty is due to the...
100
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
There has been little attention to search based test data generation in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have e...
100
click to vote
EMO
2009
Springer
15 years 8 months ago
2009
Springer
When training Support Vector Machine (SVM), selection of a training data set becomes an important issue, since the problem of overfitting exists with a large number of training da...
123
click to vote
IWINAC
2007
Springer
15 years 7 months ago
2007
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
111
click to vote
CEC
2007
IEEE
15 years 5 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...