Sciweavers

5244 search results - page 697 / 1049
» Structural Complexity of AvgBPP
Sort
View
201
Voted
ECAL
2005
Springer
16 years 10 days ago
(Co)Evolution of (De)Centralized Neural Control for a Gravitationally Driven Machine
Using decentralized control structures for robot control can offer a lot of advantages, such as less complexity, better fault tolerance and more flexibility. In this paper the ev...
Steffen Wischmann, Martin Hülse, Frank Pasema...
EUROPAR
2005
Springer
16 years 10 days ago
Automatic Tuning of PDGEMM Towards Optimal Performance
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
Sascha Hunold, Thomas Rauber
ICANN
2005
Springer
16 years 9 days ago
Information Visualization for Knowledge Extraction in Neural Networks
In this paper, a user-centred innovative method of knowledge extraction in neural networks is described. This is based on information visualization techniques and tools for artific...
Liz J. Stuart, Davide Marocco, Angelo Cangelosi
ANTS
2004
Springer
149views Algorithms» more  ANTS 2004»
16 years 6 days ago
A Binary Recursive Gcd Algorithm
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
Damien Stehlé, Paul Zimmermann
ESA
2004
Springer
137views Algorithms» more  ESA 2004»
16 years 6 days ago
Fast 3-Coloring Triangle-Free Planar Graphs
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
Lukasz Kowalik