Sciweavers

882 search results - page 122 / 177
» Local Search for Very Large SAT Problems
Sort
View
122
Voted
ICML
2002
IEEE
16 years 4 months ago
Learning from Scarce Experience
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
Leonid Peshkin, Christian R. Shelton
CASES
2004
ACM
15 years 7 months ago
Scalable custom instructions identification for instruction-set extensible processors
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
Pan Yu, Tulika Mitra
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
15 years 7 months ago
Combining genetic algorithms with squeaky-wheel optimization
The AI optimization algorithm called "Squeaky-Wheel Optimization" (SWO) has proven very effective in a variety of real-world applications. Although the ideas behind SWO ...
Justin Terada, Hoa Vo, David Joslin
EMO
2001
Springer
209views Optimization» more  EMO 2001»
15 years 8 months ago
Comparison of Evolutionary and Deterministic Multiobjective Algorithms for Dose Optimization in Brachytherapy
We compare two multiobjective evolutionary algorithms, with deterministic gradient based optimization methods for the dose optimization problem in high-dose rate (HDR) brachythera...
Natasa Milickovic, Michael Lahanas, Dimos Baltas, ...
144
Voted
KDD
2010
ACM
197views Data Mining» more  KDD 2010»
15 years 1 months ago
Semi-supervised feature selection for graph classification
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
Xiangnan Kong, Philip S. Yu