400 search results - page 58 / 80 » What Makes a Problem GP-Hard |
135
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
149
Voted
DOCENG
2006
ACM
15 years 10 months ago
2006
ACM
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
126
click to vote
SIGECOM
2003
ACM
15 years 9 months ago
2003
ACM
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
159
Voted
NIPS
2001
15 years 5 months ago
2001
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
140
Voted
OPODIS
2003
15 years 5 months ago
2003
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...