A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-48686-0_35
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

New Algorithms for Lineark-Matroid Intersection and Matroidk-Parity Problems

Mathematical Programming, Series B
MathematicsSoftware
1995English

Speeding Up Accurate Scattering Factors Calculation for Macromolecules. Algorithms for Aspherical Atom Formalism and Direct Summation

Acta Crystallographica Section A: Foundations and Advances
Materials ScienceCondensed Matter PhysicsTheoretical ChemistryBiochemistryStructural BiologyInorganic ChemistryPhysical
2015English

A Branch-And-Bound Approach for Tautomer Enumeration

Journal of Cheminformatics
Computer GraphicsInformation SciencesLibraryTheoretical ChemistryComputer Science ApplicationsComputer-Aided DesignPhysical
2010English

An Approach for Evaluating New Energy Industry Security and Its Application

2017English

New Algorithms for Beam Formation and Its Comparison

International Journal of Computer Applications
2012English

POTAGE: A Visualisation Tool for Speeding Up Gene Discovery in Wheat

Scientific Reports
Multidisciplinary
2017English

Speeding Up Snakes

2006English

Speeding Up and Parallelizing the GARFIELD++

EPJ Web of Conferences
AstronomyPhysics
2018English

On Efficient Parallelizing of the Algorithms for Discrete Enumeration Problems

Machine Learning and Data Analysis
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy