3758 search results - page 186 / 752 » A Complete Subsumption Algorithm |
111
Voted
AAAI
2008
15 years 4 months ago
2008
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...
130
Voted
ICTAI
2010
IEEE
15 years 5 days ago
2010
IEEE
A significant body of work in multiagent systems over more than two decades has focused on multi-agent coordination (1). Many challenges in multi-agent coordination can be modeled ...
ICML
2005
IEEE
16 years 3 months ago
2005
IEEE
Supervised clustering is the problem of training a clustering algorithm to produce desirable clusterings: given sets of items and complete clusterings over these sets, we learn ho...
107
click to vote
BIRTHDAY
2009
Springer
15 years 9 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
100
Voted
NLPRS
2001
Springer
15 years 6 months ago
2001
Springer
WeproposeanewapproachtoEMlearning of PCFGs. We completely separate the process of EM learning from that of parsing, andfor theformer, weintroduce a new EM algorithm called the gra...