7648 search results - page 266 / 1530 » A Data Locality Optimizing Algorithm |
163
Voted
AUTOMATICA
2008
15 years 3 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
122
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
129
Voted
ROBOCUP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
137
Voted
TEC
2008
15 years 3 months ago
2008
Under mild conditions, it can be induced from the Karush-Kuhn-Tucker condition that the Pareto set, in the decision space, of a continuous multiobjective optimization problem is (m...
118
click to vote
PKDD
1999
Springer
15 years 7 months ago
1999
Springer
: For many KDD applications finding the outliers, i.e. the rare events, is more interesting and useful than finding the common cases, e.g. detecting criminal activities in E-commer...