1639 search results - page 30 / 328 » Anytime Heuristic Search |
126
Voted
IWANN
2005
Springer
15 years 9 months ago
2005
Springer
In this work, we suggest a new feature selection technique that lets us use the wrapper approach for finding a well suited feature set for distinguishing experiment classes in hig...
128
Voted
ICTAI
2006
IEEE
15 years 9 months ago
2006
IEEE
Standard tabu search methods are based on the complete exploration of current solution neighborhood. However, for some problems with very large neighborhood or time-consuming eval...
116
Voted
CG
2000
Springer
15 years 8 months ago
2000
Springer
: We present a new algorithm for selective search by iterative expansion of leaf nodes. The algorithm reasons with leaf evaluations in a way that leads to high confidence in the c...
133
Voted
WISE
2009
Springer
15 years 10 months ago
2009
Springer
Planning out maintenance tasks to increase the quality of Web applications can be difficult for a manager. First, it is hard to evaluate the precise effect of a task on quality. S...
104
Voted
EWCBR
1994
Springer
15 years 7 months ago
1994
Springer
Theusual case-basedreasoningapproachassumesthat foreachgivenprobleminstanceit is necessaryto retrieve fromscratcha similarcasefromthe casebase.Therefore, anindexedmemorystmctareor...