526 search results - page 12 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
INFORMATICALT
2000
14 years 9 months ago
2000
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...
EAAI
2007
14 years 9 months ago
2007
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is de...
ISI
2005
Springer
15 years 3 months ago
2005
Springer
Intelligence analysts are flooded with massive amounts of data from a multitude of sources and in many formats. From this raw data they attempt to gain insight that will provide de...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Geometric Particle Swarm Optimization (GPSO) is a recently introduced formal generalization of traditional Particle Swarm Optimization (PSO) that applies naturally to both continu...
MIDDLEWARE
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. The performance of multi-tier systems is known to be significantly degraded by workloads that place bursty service demands on system resources. Burstiness can cause queu...