129 search results - page 15 / 26 » Optimal solutions for moving target search |
100
click to vote
AAAI
2004
15 years 1 months ago
2004
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
102
click to vote
ANOR
2011
14 years 3 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
Active shape models are a powerful and widely used tool to interpret complex image data. By building models of shape variation they enable search algorithms to use a priori knowle...
108
click to vote
CEC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
109
click to vote
CG
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...