Sciweavers

446 search results - page 78 / 90
» A Combinatorial Theorem for Trees
Sort
View
SBACPAD
2008
IEEE
170views Hardware» more  SBACPAD 2008»
16 years 6 days ago
Using Analytical Models to Efficiently Explore Hardware Transactional Memory and Multi-Core Co-Design
Transactional memory is emerging as a parallel programming paradigm for multi-core processors. Despite the recent interest in transactional memory, there has been no study to char...
James Poe, Chang-Burm Cho, Tao Li
BIBE
2007
IEEE
124views Bioinformatics» more  BIBE 2007»
16 years 2 days ago
Finding Cancer-Related Gene Combinations Using a Molecular Evolutionary Algorithm
—High-throughput data such as microarrays make it possible to investigate the molecular-level mechanism of cancer more efficiently. Computational methods boost the microarray ana...
Chan-Hoon Park, Soo-Jin Kim, Sun Kim, Dong-Yeon Ch...
FSTTCS
2007
Springer
16 years 2 hour ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
FUN
2007
Springer
98views Algorithms» more  FUN 2007»
16 years 2 hour ago
Die Another Day
The Hydra was a many-headed monster from Greek mythology that would immediately replace a head that was cut off by one or two new heads. It was the ask of Hercules to kill this mon...
Rudolf Fleischer
ECAI
2004
Springer
15 years 11 months ago
Learning Techniques for Automatic Algorithm Portfolio Selection
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
Alessio Guerri, Michela Milano