2343 search results - page 110 / 469 » Visual-Concept Search Solved |
129
click to vote
UIST
2006
ACM
15 years 10 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
141
Voted
LPAR
2005
Springer
15 years 10 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...
162
Voted
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
130
click to vote
WOA
2000
15 years 5 months ago
2000
Big changes are taking place in the area of information supply and demand on Internet. The first big change, which took place quite a while ago, is related to the type of informat...
166
click to vote
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper, the dynamic multi-swarm particle swarm optimizer (DMS-PSO) and a sub-regional harmony search (SHS) are hybridized to obtain DMS-PSO-SHS. A Modified multi-trajectory ...