Sciweavers

666 search results - page 46 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
13 years 9 months ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham
ICCAD
1996
IEEE
112views Hardware» more  ICCAD 1996»
14 years 1 months ago
GRASP - a new search algorithm for satisfiability
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed searchp...
João P. Marques Silva, Karem A. Sakallah
PKDD
2000
Springer
134views Data Mining» more  PKDD 2000»
14 years 27 days ago
Induction of Multivariate Decision Trees by Using Dipolar Criteria
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...
Leon Bobrowski, Marek Kretowski
POPL
1994
ACM
14 years 1 months ago
An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph
We present a new incremental algorithm for the problem of maintaining the dominator tree of a reducible flowgraph as the flowgraph undergoes changes such as the insertion and dele...
G. Ramalingam, Thomas W. Reps
EUROPAR
2004
Springer
14 years 2 months ago
A Coarse-Grained Parallel Algorithm for Spanning Tree and Connected Components
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
Edson Norberto Cáceres, Frank K. H. A. Dehn...