526 search results - page 54 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
This paper presents a variant of Quantum behaved Particle Swarm Optimization (QPSO) named Q-QPSO for solving global optimization problems. The Q-QPSO algorithm is based on the cha...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
ISPD
2003
ACM
15 years 3 months ago
2003
ACM
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
A major challenge in efficiently solving distributed resource allocation problems is to cope with the dynamic state changes that characterise such systems. An effective solution t...
123
click to vote
FPL
2010
Springer
14 years 7 months ago
2010
Springer
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...