Sciweavers

1197 search results - page 110 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
WCE
2007
13 years 9 months ago
Local Approximation of Pareto Surface
—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...
S. V. Utyuzhnikov, Jeremy Maginot, Marin D. Guenov
ECCV
2010
Springer
14 years 1 months ago
Modeling and Analysis of Dynamic Behaviors of Web Image Collections
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...
COCOA
2008
Springer
13 years 10 months ago
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
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...
Peter Damaschke
IROS
2007
IEEE
126views Robotics» more  IROS 2007»
14 years 2 months ago
A graph theoretic approach to optimal target tracking for mobile robot teams
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...
Jason C. Derenick, John R. Spletzer, M. Ani Hsieh
CAD
2007
Springer
13 years 8 months ago
Non-iterative approach for global mesh optimization
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 ...
Ligang Liu, Chiew-Lan Tai, Zhongping Ji, Guojin Wa...