Results 71 to 80 of about 64,576 (188)

Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems [PDF]

open access: yes
The generalized minimum spanning tree problem is a generalization of the minimum spanning tree problem. This network design problems finds several practical applications, especially when one considers the design of a large-capacity backbone network ...
Ghosh, Diptesh
core  

Totem: a case study in HEP [PDF]

open access: yes, 1997
It is being proved that the neurochip \Totem{} is a viable solution for high quality and real time computational tasks in HEP, including event classification, triggering and signal processing.
Dusini, S.   +7 more
core   +1 more source

A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem [PDF]

open access: yes
In this paper we present a probabilistic tabu search algorithm for the generalized minimum spanning tree problem. The basic idea behind the algorithm is to use preprocessing operations to arrive at a probability value for each vertex which roughly ...
Ghosh, Diptesh
core  

Forest Management Zone Design with a Tabu Search Algorithm [PDF]

open access: yes
Increased conflicts between timber production and environmental protection led some analysts to advocate land-use segregation, often referred to as forest management zoning.
Emina Krcmar   +3 more
core  

Tabu search for high level synthesis [PDF]

open access: yes, 2010
Tabu Search Vignette on Fred GLover's web ...
Sevaux, Marc
core  

Home - About - Disclaimer - Privacy