Sciweavers

4797 search results - page 616 / 960
» The complexity of partition tasks
Sort
View
FGCS
2000
145views more  FGCS 2000»
15 years 6 months ago
Ant algorithms and stigmergy
Ant colonies, and more generally social insect societies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organiz...
Marco Dorigo, Eric Bonabeau, Guy Theraulaz
IJMMS
2000
76views more  IJMMS 2000»
15 years 6 months ago
On the notion of interestingness in automated mathematical discovery
We survey five mathematical discovery programs by looking in detail at the discovery processes they illustrate and the success they've had. We focus on how they estimate the ...
Simon Colton, Alan Bundy, Toby Walsh
PC
2000
93views Management» more  PC 2000»
15 years 6 months ago
Scheduling outtrees of height one in the LogP model
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
Jacques Verriet
IVC
2002
112views more  IVC 2002»
15 years 6 months ago
Using distance transforms to decompose 3D discrete objects
Object decomposition into simpler parts greatly diminishes the complexity of a recognition task. In this paper, we present a method to decompose a 3D discrete object into nearly c...
Stina Svensson, Gabriella Sanniti di Baja
NN
1998
Springer
15 years 6 months ago
Neural control of rhythmic arm movements
In this paper we present an approach to robot arm control based on exploiting the dynamical properties of a simple neural network oscillator circuit coupled to the joints of an ar...
Matthew M. Williamson