Sciweavers

1639 search results - page 171 / 328
» Anytime Heuristic Search
Sort
View
GECCO
2007
Springer
142views Optimization» more  GECCO 2007»
14 years 4 months ago
Improving global numerical optimization using a search-space reduction algorithm
We have developed an algorithm for reduction of search-space, called Domain Optimization Algorithm (DOA), applied to global optimization. This approach can efficiently eliminate ...
Vinicius Veloso de Melo, Alexandre C. B. Delbem, D...
ACMSE
2006
ACM
14 years 4 months ago
Support vector machines for collaborative filtering
Support Vector Machines (SVMs) have successfully shown efficiencies in many areas such as text categorization. Although recommendation systems share many similarities with text ca...
Zhonghang Xia, Yulin Dong, Guangming Xing
CP
2005
Springer
14 years 3 months ago
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
Roie Zivan, Amnon Meisels
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
14 years 3 months ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
14 years 3 months ago
Search-based improvement of subsystem decompositions
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...