1197 search results - page 110 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
149
click to vote
WCE
2007
15 years 6 months ago
2007
—In the design process of complex systems, the designer is solving an optimization problem, which involves different disciplines and where all design criteria have to be optimize...
184
Voted
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Can we model the temporal evolution of topics in Web image collections? If so, can we exploit the understanding of dynamics to solve novel visual problems or improve reco...
171
click to vote
COCOA
2008
Springer
15 years 7 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
153
click to vote
IROS
2007
IEEE
16 years 4 hour ago
2007
IEEE
Abstract— In this paper, we present an optimization framework for target tracking with mobile robot teams. The target tracking problem is modeled as a generic semidefinite progr...
144
click to vote
CAD
2007
Springer
15 years 5 months ago
2007
Springer
This paper presents a global optimization operator for arbitrary meshes. The global optimization operator is composed of two main terms, one part is the global Laplacian operator ...