7065 search results - page 1069 / 1413 » Iterative Scheduling Algorithms |
192
click to vote
CP
1997
Springer
15 years 11 months ago
1997
Springer
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
192
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...
196
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Semi-supervised clustering uses the limited background knowledge to aid unsupervised clustering algorithms. Recently, a kernel method for semi-supervised clustering has been introd...
198
click to vote
INFOCOM
1995
IEEE
15 years 10 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
184
click to vote
AIPS
2008
15 years 9 months ago
2008
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...