1914 search results - page 188 / 383 » Evaluation of a Catalytic Search Algorithm |
149
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
111
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Coevolutionary algorithms search for test cases as part of the search process. The resulting adaptive evaluation function takes away the need to define a fixed evaluation function...
121
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used betwe...
136
click to vote
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
125
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
Web graphs are approximate snapshots of the web, created by search engines. Their creation is an error-prone procedure that relies on the availability of Internet nodes and the fa...