Sciweavers

340 search results - page 41 / 68
» A New Algorithm for the Construction of Optimal B-Trees
Sort
View
SDM
2007
SIAM
117views Data Mining» more  SDM 2007»
13 years 9 months ago
Discriminating Subsequence Discovery for Sequence Clustering
In this paper, we explore the discriminating subsequencebased clustering problem. First, several effective optimization techniques are proposed to accelerate the sequence mining p...
Jianyong Wang, Yuzhou Zhang, Lizhu Zhou, George Ka...
ISPD
1997
ACM
74views Hardware» more  ISPD 1997»
13 years 12 months ago
A matrix synthesis approach to thermal placement
— In this paper, we consider the thermal placement problem for gate arrays. We introduce a new combinatorial optimization problem, matrix synthesis problem (MSP), to model the th...
Chris C. N. Chu, D. F. Wong
EOR
2010
116views more  EOR 2010»
13 years 7 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...
EOR
2007
364views more  EOR 2007»
13 years 7 months ago
Heuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
Celso C. Ribeiro, Sebastián Urrutia
AI
1999
Springer
13 years 7 months ago
Learning by Discovering Concept Hierarchies
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
Blaz Zupan, Marko Bohanec, Janez Demsar, Ivan Brat...