3241 search results - page 328 / 649 » Challenges for Dataset Search |
181
click to vote
ML
2000
ACM
15 years 6 months ago
2000
ACM
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
159
click to vote
SIGKDD
2000
15 years 6 months ago
2000
With over 800 million pages covering most areas of human endeavor, the World-wide Web is a fertile ground for data mining research to make a di erence to the e ectiveness of infor...
169
click to vote
PAMI
2007
15 years 6 months ago
2007
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
181
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract— To compute collision-free and dynamicallyfeasibile trajectories that satisfy high-level specifications given in a planning-domain definition language, this paper prop...
167
click to vote
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
This paper is motivated by some recent, intriguing research results involving agent-organized networks (AONs). In AONs, nodes represent agents, and collaboration between nodes are...