Search Sciweavers | Sciweavers

2407 search results - page 8 / 482

» The evolutionary forest algorithm

click to vote

PRICAI
2000
Springer

116views Artificial Intelligence» more PRICAI 2000»

The Lumberjack Algorithm for Learning Linked Decision Forests

15 years 3 months ago

Download www.cs.cmu.edu

While the decision tree is an effective representation that has been used in many domains, a tree can often encode a concept inefficiently. This happens when the tree has to repres...

William T. B. Uther, Manuela M. Veloso

claim paper

Read More »

108

click to vote

PPOPP
2009
ACM

169views Distributed and Parallel Com...» more PPOPP 2009»

An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs

16 years 14 days ago

Download www.cc.gatech.edu

Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...

Seunghwa Kang, David A. Bader

claim paper

Read More »

click to vote

JPDC
2006

134views more JPDC 2006»

Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs

14 years 12 months ago

Download domino.research.ibm.com

Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...

David A. Bader, Guojing Cong

claim paper

Read More »

click to vote

CATS
2007

94views Applied Computing» more CATS 2007»

Fast Exponential-Time Algorithms for the Forest Counting in Graph Classes

15 years 1 months ago