29908 search results - page 5641 / 5982 » On the Complexity of |
218
click to vote
MLMTA
2003
15 years 7 months ago
2003
Abstract— The prediction of the future states in MultiAgent Systems has been a challenging problem since the begining of MAS. Robotic soccer is a MAS environment in which the pre...
186
click to vote
NIPS
2003
15 years 7 months ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
193
click to vote
SDM
2003
SIAM
15 years 7 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
158
click to vote
AAAI
1998
15 years 7 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
187
click to vote
AAAI
2000
15 years 7 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...