6095 search results - page 44 / 1219 » Learning in Local Search |
LPAR
2005
Springer
15 years 3 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
WWW
2009
ACM
15 years 10 months ago
2009
ACM
Capturing the context of a user's query from the previous queries and clicks in the same session may help understand the user's information need. A context-aware approac...
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, the multiple trajectory search (MTS) is presented for large scale global optimization. The MTS uses multiple agents to search the solution space concurrently. Eac...