Sciweavers

3894 search results - page 485 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ICCBR
2003
Springer
15 years 9 months ago
An Empirical Analysis of Linear Adaptation Techniques for Case-Based Prediction
This paper is an empirical investigation into the effectiveness of linear scaling adaptation for case-based software project effort prediction. We compare two variants of a linea...
Colin Kirsopp, Emilia Mendes, Rahul Premraj, Marti...
ICALP
1999
Springer
15 years 8 months ago
Stable Marriage with Incomplete Lists and Ties
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and seve...
Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasu...
CEC
2008
IEEE
15 years 11 months ago
DEACO: Hybrid Ant Colony Optimization with Differential Evolution
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
Xiangyin Zhang, Haibin Duan, Jiqiang Jin
COLT
2007
Springer
15 years 10 months ago
Learning Large-Alphabet and Analog Circuits with Value Injection Queries
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin
ICML
1999
IEEE
16 years 5 months ago
Least-Squares Temporal Difference Learning
Excerpted from: Boyan, Justin. Learning Evaluation Functions for Global Optimization. Ph.D. thesis, Carnegie Mellon University, August 1998. (Available as Technical Report CMU-CS-...
Justin A. Boyan