Sciweavers

1142 search results - page 57 / 229
» Set Variables and Local Search
Sort
View
IJCNN
2000
IEEE
14 years 2 months ago
Metrics that Learn Relevance
We introduce an algorithm for learning a local metric to a continuous input space that measures distances in terms of relevance to the processing task. The relevance is defined a...
Samuel Kaski, Janne Sinkkonen
ECAI
2004
Springer
14 years 3 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
14 years 1 months ago
Uniform sampling of local pareto-optimal solution curves by pareto path following and its applications in multi-objective GA
Although multi-objective GA (MOGA) is an efficient multiobjective optimization (MOO) method, it has some limitations that need to be tackled, which include unguaranteed uniformity...
Ken Harada, Jun Sakuma, Shigenobu Kobayashi, Isao ...
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
14 years 10 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...
SAT
2005
Springer
107views Hardware» more  SAT 2005»
14 years 3 months ago
Local and Global Complete Solution Learning Methods for QBF
Solvers for Quantified Boolean Formulae (QBF) use many analogues of technique from SAT. A significant amount of work has gone into extending conflict based techniques such as co...
Ian P. Gent, Andrew G. D. Rowley