6095 search results - page 337 / 1219 » Learning in Local Search |
166
click to vote
DASFAA
2009
IEEE
15 years 10 months ago
2009
IEEE
Observing that current Global Similarity Measures (GSM) which average the effect of few significant differences on all dimensions may cause possible performance limitation, we prop...
199
click to vote
CI
2007
15 years 6 months ago
2007
: When one tries to use the Web as a dictionary or encyclopedia, entering some single term into a search engine, the highly-ranked pages in the result can include irrelevant or use...
193
click to vote
SIAMJO
2002
15 years 6 months ago
2002
Motivated by some results for linear programs and complementarity problems, this paper gives some new characterizations of the central path conditions for semidefinite programs. Ex...
177
click to vote
IJKESDP
2010
15 years 5 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
191
click to vote
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...