Sciweavers

1242 search results - page 149 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
ICCBR
1995
Springer
15 years 1 months ago
On the use of CBR in optimisation problems such as the TSP
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...
Padraig Cunningham, Barry Smyth, Neil J. Hurley
ATAL
2008
Springer
14 years 12 months ago
Structure in threes: modelling organization-oriented software architectures built upon multi-agent systems
Software systems are subject to increasing complexity and in need of efficient structuring. Multi-agent system research has come up with approaches for an organization-oriented co...
Matthias Wester-Ebbinghaus, Daniel Moldt
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
14 years 11 months ago
Runtime analysis of binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
Dirk Sudholt, Carsten Witt
DEDS
2008
108views more  DEDS 2008»
14 years 10 months ago
An Algorithmic Toolbox for Network Calculus
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
Anne Bouillard, Eric Thierry
URBAN
2008
128views more  URBAN 2008»
14 years 9 months ago
Discerning landslide susceptibility using rough sets
Rough set theory has been primarily known as a mathematical approach for analysis of a vague description of objects. This paper explores the use of rough set theory to manage the ...
Pece V. Gorsevski, Piotr Jankowski