2109 search results - page 134 / 422 » Solving Necklace Constraint Problems |
164
click to vote
ICASSP
2009
IEEE
16 years 24 days ago
2009
IEEE
We propose a convex optimization method for maximum likelihood estimation of autoregressive models, subject to conditional independence constraints. This problem is an extension t...
150
click to vote
WLP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...
173
click to vote
AIPS
2000
15 years 7 months ago
2000
In the last years, some very promising domain independent heuristic state-space planners for STRIPS worlds, like ASP/HSP, HSPr and GRT, have been presented. These planners achieve...
145
click to vote
ICRA
2010
IEEE
15 years 4 months ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
168
click to vote
ICML
2007
IEEE
16 years 6 months ago
2007
IEEE
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...