Sciweavers

    569 search results - page 12 / 114
    » An Empirical Study of Structural Constraint Solving Techniqu...
    Sort
    View
    138
    Voted
    ASE
    1998
    81views more  ASE 1998»
    Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
    14 years 11 months ago
    Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
    Download  www.cse.ust.hk
    The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
    Steven G. Woods, Qiang Yang
    claim paper
    Read More »
    90
    Voted
    BMCBI
    2010
    116views more  BMCBI 2010»
    A hybrid approach to protein folding problem integrating constraint programming with local search
    14 years 11 months ago
    A hybrid approach to protein folding problem integrating constraint programming with local search
    Download  www.biomedcentral.com
    Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
    Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel
    claim paper
    Read More »
    97
    Voted
    ICML
    2009
    IEEE
    163views Machine Learning» more  ICML 2009»
    Structure learning of Bayesian networks using constraints
    16 years 14 days ago
    Structure learning of Bayesian networks using constraints
    Download  www.ecse.rpi.edu
    This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
    Cassio Polpo de Campos, Zhi Zeng, Qiang Ji
    claim paper
    Read More »
    SPLC
    2008
    115views Software Engineering» more  SPLC 2008»
    Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
    15 years 1 months ago
    Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
    Download  www.dre.vanderbilt.edu
    Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
    Jules White, B. Doughtery, Douglas C. Schmidt
    claim paper
    Read More »
    CP
    2006
    Springer
    118views Artificial Intelligence» more  CP 2006»
    : A Bottom-Up Approach for Solving Quantified CSPs
    15 years 3 months ago
    : A Bottom-Up Approach for Solving Quantified CSPs
    Download  www.lirmm.fr
    Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
    Guillaume Verger, Christian Bessière
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2025, USA.