138 search results - page 27 / 28 » Hardness of fully dense problems |
AAAI
2010
13 years 6 months ago
2010
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
WEBNET
1996
13 years 5 months ago
1996
: Because digital libraries are expensive to create and maintain, Internet analogs of public libraries--reliable, quality, community services--have only recently begun to appear. A...
SIGIR
2008
ACM
13 years 4 months ago
2008
ACM
This paper addresses the issue of query refinement, which involves reformulating ill-formed search queries in order to enhance relevance of search results. Query refinement typica...
SIGMETRICS
2002
ACM
13 years 4 months ago
2002
ACM
Scheduling in large-scale parallel systems has been and continues to be an important and challenging research problem. Several key factors, including the increasing use of off-the...
CIKM
2010
Springer
13 years 3 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...