Sciweavers

12519 search results - page 319 / 2504
» Approximation Problems Categories
Sort
View
IWBRS
2005
Springer
134views Biometrics» more  IWBRS 2005»
16 years 4 days ago
Using Score Normalization to Solve the Score Variation Problem in Face Authentication
Abstract. This paper investigates the score normalization technique for enhancing the performance of face authentication. We firstly discuss the thresholding approach for face auth...
Fei Yang, Shiguang Shan, Bingpeng Ma, Xilin Chen, ...
GECCO
2004
Springer
122views Optimization» more  GECCO 2004»
16 years 1 days ago
Gradient-Based Learning Updates Improve XCS Performance in Multistep Problems
This paper introduces a gradient-based reward prediction update mechanism to the XCS classifier system as applied in neuralnetwork type learning and function approximation mechani...
Martin V. Butz, David E. Goldberg, Pier Luca Lanzi
ISSAC
2004
Springer
135views Mathematics» more  ISSAC 2004»
16 years 20 hour ago
Absolute polynomial factorization in two variables and the knapsack problem
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
Guillaume Chèze
CDC
2009
IEEE
123views Control Systems» more  CDC 2009»
15 years 11 months ago
On the myopic policy for a class of restless bandit problems with applications in dynamic multichannel access
We consider a class of restless multi-armed bandit problems that arises in multi-channel opportunistic communications, where channels are modeled as independent and stochastically...
Keqin Liu, Qing Zhao
EVOW
2006
Springer
15 years 10 months ago
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
Yuichi Nagata