4526 search results - page 566 / 906 » Algorithmic problems related to the Internet |
162
click to vote
AAAI
2008
15 years 10 months ago
2008
A recurring theme in AI and multiagent systems is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's...
187
click to vote
AAAI
2007
15 years 10 months ago
2007
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
169
click to vote
IJCAI
1997
15 years 9 months ago
1997
Generating query-answering plans for information gathering agents requires to translate a user query, formulated in terms of a set of virtual relations, to a query that uses relat...
212
click to vote
AUTOMATICA
2008
15 years 7 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...
177
click to vote
IJCV
2010
15 years 6 months ago
2010
Humans demonstrate a remarkable ability to parse complicated motion sequences into their constituent structures and motions. We investigate this problem, attempting to learn the st...