4110 search results - page 508 / 822 » Efficient algorithms for the 2-gathering problem |
168
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
In this paper we propose a novel, scalable, clustering based Ordinal Regression formulation, which is an instance of a Second Order Cone Program (SOCP) with one Second Order Cone ...
189
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We develop a novel mechanism for coordinated, distributed multiagent planning. We consider problems stated as a collection of single-agent planning problems coupled by common soft...
200
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
The Distributed Constraint Optimization Problem (DCOP) is a fundamental formalism for multi-agent cooperation. A dedicated framework called Resource Constrained DCOP (RCDCOP) has ...
195
click to vote
AIPS
2006
15 years 8 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
241
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...