1197 search results - page 122 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
166
click to vote
AAAI
2010
15 years 7 months ago
2010
We consider the task of assigning experts from a portfolio of specialists in order to solve a set of tasks. We apply a Bayesian model which combines collaborative filtering with a...
160
click to vote
ICMCS
2006
IEEE
15 years 11 months ago
2006
IEEE
Kernel-based tracking approaches have proven to be more efficient in computation compared to other tracking approaches such as particle filtering. However, existing kernel-based...
171
click to vote
ECCV
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. This paper presents an endoscopic vision framework for modelbased 3D guidance of surgical instruments used in robotized laparoscopic surgery. In order to develop such a s...
152
click to vote
IROS
2008
IEEE
16 years 5 days ago
2008
IEEE
Abstract— Kinodynamic planning algorithms have the potential to find feasible control trajectories which accomplish a task even in very nonlinear or constrained dynamical system...
157
click to vote
AUTOMATICA
2008
15 years 5 months ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...