Sciweavers

6562 search results - page 53 / 1313
» Noetherianity and Combination Problems
Sort
View
HEURISTICS
2007
139views more  HEURISTICS 2007»
15 years 20 days ago
A composite-neighborhood tabu search approach to the traveling tournament problem
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
Luca Di Gaspero, Andrea Schaerf
118
Voted
SWARM
2010
SPRINGER
219views Optimization» more  SWARM 2010»
15 years 5 months ago
Biogeography Migration Algorithm for Traveling Salesman Problem
Biogeography-based optimization algorithm(BBO) is a new kind of optimization algorithm based on Biogeography. It is designed based on the migration strategy of animals to solve the...
Hongwei Mo, Lifang Xu
96
Voted
ASPDAC
2001
ACM
107views Hardware» more  ASPDAC 2001»
15 years 4 months ago
An efficient solution to the storage correspondence problem for large sequential circuits
Abstract- Traditional state-traversal-basedmethods for verifying sequential circuits are computationally infeasible for circuits with a large number of memory elements. However, if...
Wanlin Cao, D. M. H. Walker, Rajarshi Mukherjee
95
Voted
KDD
2004
ACM
123views Data Mining» more  KDD 2004»
16 years 1 months ago
A DEA approach for model combination
This paper proposes a novel Data Envelopment Analysis (DEA) based approach for model combination. We first prove that for the 2-class classification problems DEA models identify t...
Zhiqiang Zheng, Balaji Padmanabhan, Haoqiang Zheng
82
Voted
ICPR
2008
IEEE
15 years 7 months ago
Combining hierarchical clusterings using min-transitive closure
In the past, clusterings combination approaches are based on “flat” clustering algorithms, i.e. algorithms that operate on non-hierarchical clustering schemes. These approache...
Abdolreza Mirzaei, Mohammad Rahmati