2922 search results - page 262 / 585 » Scalable Algorithms for Distribution Search |
166
click to vote
SLS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
143
click to vote
COLT
1998
Springer
15 years 8 months ago
1998
Springer
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
146
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...
131
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
114
click to vote
LREC
2010
15 years 6 months ago
2010
Anaphora resolution is still a challenging research field in natural language processing, lacking an algorithm that correctly resolves anaphoric pronouns. Anaphoric zero pronouns ...