Sciweavers

16404 search results - page 344 / 3281
» A set coverage problem
Sort
View
MOR
2008
87views more  MOR 2008»
15 years 4 months ago
On Near Optimality of the Set of Finite-State Controllers for Average Cost POMDP
We consider the average cost problem for partially observable Markov decision processes (POMDP) with finite state, observation, and control spaces. We prove that there exists an -...
Huizhen Yu, Dimitri P. Bertsekas
TIP
2008
168views more  TIP 2008»
15 years 4 months ago
A Real-Time Algorithm for the Approximation of Level-Set-Based Curve Evolution
Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...
Yonggang Shi, William Clement Karl
182
Voted
PR
2008
202views more  PR 2008»
15 years 3 months ago
Building compact MQDF classifier for large character set recognition by subspace distribution sharing
Quadratic classifier with modified quadratic discriminant function (MQDF) has been successfully applied to recognition of handwritten characters to achieve very good performance. ...
Teng Long, Lianwen Jin
147
Voted
GECCO
2007
Springer
289views Optimization» more  GECCO 2007»
15 years 11 months ago
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan,...
FGR
2002
IEEE
161views Biometrics» more  FGR 2002»
15 years 10 months ago
Baseline Results for the Challenge Problem of Human ID Using Gait Analysis
Identification of people from gait captured on video has become a challenge problem in computer vision. However, there is not a baseline algorithm or standard dataset for measuri...
P. Jonathon Phillips, Patrick Grother, Sudeep Sark...