Sciweavers

779 search results - page 137 / 156
» Information-theoretic Competitive Learning
Sort
View
AIIDE
2009
13 years 8 months ago
Improving Offensive Performance Through Opponent Modeling
Although in theory opponent modeling can be useful in any adversarial domain, in practice it is both difficult to do accurately and to use effectively to improve game play. In thi...
Kennard Laviers, Gita Sukthankar, David W. Aha, Ma...
CEC
2010
IEEE
13 years 8 months ago
A novel memetic algorithm for constrained optimization
In this paper, we present a memetic algorithm with novel local optimizer hybridization strategy for constrained optimization. The developed MA consists of multiple cycles. In each ...
Jianyong Sun, Jonathan M. Garibaldi
AAAI
2010
13 years 7 months ago
Fast Conditional Density Estimation for Quantitative Structure-Activity Relationships
Many methods for quantitative structure-activity relationships (QSARs) deliver point estimates only, without quantifying the uncertainty inherent in the prediction. One way to qua...
Fabian Buchwald, Tobias Girschick, Eibe Frank, Ste...
CII
2008
100views more  CII 2008»
13 years 7 months ago
Knowledge formalization in experience feedback processes: An ontology-based approach
Because of the current trend of integration and interoperability of industrial systems, their size and complexity continue to grow making it more difficult to analyze, to understa...
Bernard Kamsu Foguem, Thierry Coudert, C. Bé...
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 7 months ago
On the Finite Time Convergence of Cyclic Coordinate Descent Methods
Cyclic coordinate descent is a classic optimization method that has witnessed a resurgence of interest in machine learning. Reasons for this include its simplicity, speed and stab...
Ankan Saha, Ambuj Tewari