Sciweavers

4679 search results - page 91 / 936
» Modeling When Connections Are the Problem
Sort
View
CONNECTION
2004
83views more  CONNECTION 2004»
15 years 1 months ago
Toward open-ended evolutionary robotics: evolving elementary robotic units able to self-assemble and self-reproduce
In this paper we discuss the limitations of current evolutionary robotics models and we propose a new framework that might solve some of these problems and lead to an open-ended e...
Raffaele Bianco, Stefano Nolfi
FLAIRS
2007
15 years 3 months ago
Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
Pavel Surynek, Roman Barták
IPPS
2010
IEEE
14 years 11 months ago
A general algorithm for detecting faults under the comparison diagnosis model
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
Iain A. Stewart
ICC
2007
IEEE
15 years 8 months ago
p-Cycle Network Design for Specified Minimum Dual-Failure Restorability
— Dual-failure scenarios are a real possibility in today’s optical networks and it is becoming more and more important for carriers and network operators to consider them when ...
Wei Li, John Doucette, Ming Zuo
NN
2007
Springer
15 years 1 months ago
Chaotic pattern transitions in pulse neural networks
In models of associative memory composed of pulse neurons, chaotic pattern transitions where the pattern retrieved by the network changes chaotically were found. The network is co...
Takashi Kanamaru