131
Voted
ANTSW
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
133
Voted
ATVA
2004
Springer
15 years 7 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
127
Voted
ANTSW
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we look at how the structure of the social network and the nature of the social interactions can affect the behaviour of particle swarms. To this end, we create and ...
145
Voted
ANTSW
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Mobile ad hoc networks are a class of highly dynamic networks. In previous work, we developed a new routing algorithm, called AntHocNet, for these challenging network env...
124
click to vote
ANTSW
2006
Springer
15 years 7 months ago
2006
Springer
The particle swarm algorithm contains elements which map fairly strongly to the foraging problem in behavioural ecology. In this paper, we show how some simple adaptions to the sta...