Sciweavers

2397 search results - page 159 / 480
» Applications of integer relation algorithms
Sort
View
JMLR
2006
145views more  JMLR 2006»
15 years 6 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
JCO
1998
136views more  JCO 1998»
15 years 6 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
COLOGNETWENTE
2010
15 years 3 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
TJS
2010
145views more  TJS 2010»
15 years 1 months ago
Analyzing and enhancing the parallel sort operation on multithreaded architectures
The Sort operation is a core part of many critical applications. Despite the large efforts to parallelize it, the fact that it suffers from high data-dependencies vastly limits it...
Layali K. Rashid, Wessam Hassanein, Moustafa A. Ha...
MI
1993
15 years 7 months ago
Controlling a steel mill with BOXES
We describe an application of the BOXES learning algorithm of Michie and Chambers (1968) to a large-scale, real-world problem, namely, learning to control a steel mill. By applyin...
Michael McGarity, Claude Sammut, David P. Clements