4695 search results - page 106 / 939 » Software Clustering Techniques and the Use of Combined Algor... |
176
click to vote
HM
2007
Springer
16 years 15 days ago
2007
Springer
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
145
click to vote
FSTTCS
2001
Springer
15 years 10 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
147
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was sh...
146
click to vote
ISI
2007
Springer
16 years 14 days ago
2007
Springer
Abstract—We present an extended version of a software system SIGHTS1 (Statistical Identification of Groups Hidden in Time and Space), which can be used for the discovery, analys...
191
click to vote
TCIAIG
2010
15 years 1 months ago
2010
Monte-Carlo tree search has recently been very successful for game playing particularly for games where the evaluation of a state is difficult to compute, such as Go or General Gam...