Sciweavers

Share
12 search results - page 3 / 3
» eurocast 2009
Sort
View
EUROCAST
2009
Springer
153views Hardware» more  EUROCAST 2009»
10 years 2 months ago
Algorithm for Testing the Leibniz Algebra Structure
Abstract. Given a basis of a vector space V over a field K and a multiplication table which defines a bilinear map on V , we develop a computer program on Mathematica which checks ...
José Manuel Casas, Manuel A. Insua, Manuel ...
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
10 years 11 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
books