Sciweavers

1236 search results - page 145 / 248
» fast 2010
Sort
View
EOR
2010
119views more  EOR 2010»
15 years 4 months ago
Adaptive Tabu Search for course timetabling
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
Zhipeng Lü, Jin-Kao Hao
EOR
2006
130views more  EOR 2006»
15 years 4 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
DSP
2007
15 years 4 months ago
Performance comparison between statistical-based and direct data domain STAPs
In the situation that a radar platform is moving very fast, the number of training data used in space-time adaptive processing (STAP) is a major concern. Less number of training d...
Santana Burintramart, Tapan K. Sarkar, Yu Zhang, M...
EOR
2007
73views more  EOR 2007»
15 years 4 months ago
Complete and robust no-fit polygon generation for the irregular stock cutting problem
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...
Edmund K. Burke, Robert S. R. Hellier, Graham Kend...
DPD
2002
168views more  DPD 2002»
15 years 3 months ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,...