14548 search results - page 172 / 2910 » The Optimal Path-Matching Problem |
IICAI
2003
14 years 15 hour ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
CDC
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper studies an optimal deployment problem for a network of robotic sensors moving in the real line. Given a spatial process of interest, each individual sensor sends a pack...
ICCV
2007
IEEE
15 years 18 days ago
2007
IEEE
This paper extends the set of problems for which a global solution can be found using modern optimization methods. In particular, the method is applied to estimation of the essent...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
NIPS
2007
14 years 2 days ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...