Sciweavers

281 search results - page 20 / 57
» heuristics 2000
Sort
View
SODA
2000
ACM
96views Algorithms» more  SODA 2000»
13 years 11 months ago
Improved Steiner tree approximation in graphs
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
Gabriel Robins, Alexander Zelikovsky
CLUSTER
2000
IEEE
13 years 9 months ago
Block-cyclic redistribution over heterogeneous networks
Clusters of workstations and networked parallel computing systems are emerging as promising computational platforms for HPC applications. The processors in such systems are typica...
Prashanth B. Bhat, Viktor K. Prasanna, Cauligi S. ...
CMOT
2000
123views more  CMOT 2000»
13 years 9 months ago
Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models
A variety of different multi-agent (competitive) network models have been described in the literature. Computational techniques for solving such models often involve the iterative...
Steven A. Gabriel, David Bernstein
IJON
2000
81views more  IJON 2000»
13 years 9 months ago
Initialization by selection for wavelet network training
We present an original initialization procedure for the parameters of feedforward wavelet networks, prior to training by gradient-based techniques. It takes advantage of wavelet f...
Yacine Oussar, Gérard Dreyfus
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
14 years 10 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang