Sciweavers

648 search results - page 44 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
EVOW
2009
Springer
13 years 5 months ago
Conquering the Needle-in-a-Haystack: How Correlated Input Variables Beneficially Alter the Fitness Landscape for Neural Networks
Abstract. Evolutionary algorithms such as genetic programming and grammatical evolution have been used for simultaneously optimizing network architecture, variable selection, and w...
Stephen D. Turner, Marylyn D. Ritchie, William S. ...
FSTTCS
2001
Springer
14 years 7 days ago
On Clustering Using Random Walks
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
David Harel, Yehuda Koren
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 9 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos
NICSO
2010
Springer
14 years 2 months ago
Evaluation of a Catalytic Search Algorithm
We investigate the search properties of pre-evolutionary random catalytic reaction networks, where reactions might be reversible, and replication is not taken for granted. Since it...
Lidia Yamamoto
VIS
2004
IEEE
139views Visualization» more  VIS 2004»
14 years 9 months ago
Compatible Triangulations of Spatial Decompositions
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...
Berk Geveci, Mathieu Malaterre, William J. Schroed...