Sciweavers

225 search results - page 8 / 45
» On Adaptive Integer Sorting
Sort
View
AAAI
2012
11 years 10 months ago
Semi-Supervised Kernel Matching for Domain Adaptation
In this paper, we propose a semi-supervised kernel matching method to address domain adaptation problems where the source distribution substantially differs from the target distri...
Min Xiao, Yuhong Guo
COR
2006
86views more  COR 2006»
13 years 8 months ago
Parametric tabu-search for mixed integer programs
A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying br...
Fred Glover
COMBINATORICS
2000
72views more  COMBINATORICS 2000»
13 years 8 months ago
Tournament Sequences and Meeussen Sequences
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 2ti. A Meeussen sequence is an increasing sequence of positive inte...
Matthew Cook, Michael Kleber
CGO
2004
IEEE
14 years 5 days ago
A Dynamically Tuned Sorting Library
Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that del...
Xiaoming Li, María Jesús Garzar&aacu...
GECCO
2006
Springer
184views Optimization» more  GECCO 2006»
14 years 3 days ago
Genetic algorithms and mixed integer linear programs for optimal strategies in a student's "sports" activity
This paper uses an entertaining student "sports" game to illustrate that GAs can be adapted to problems with uncertain properties and complexity. These problems can be s...
Thomas Butter, Franz Rothlauf, Jörn Grahl, To...