Sciweavers

    1197 search results - page 40 / 240
    » Which Dynamic Constraint Problems Can Be Solved By Ants
    Sort
    View
    UAI
    2003
    99views Artificial Intelligence» more  UAI 2003»
    Systematic vs. Non-systematic Algorithms for Solving the MPE Task
    13 years 10 months ago
    Systematic vs. Non-systematic Algorithms for Solving the MPE Task
    Download  www.ics.uci.edu
    The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
    Radu Marinescu 0002, Kalev Kask, Rina Dechter
    claim paper
    Read More »
    TKDE
    2012
    245views Formal Methods» more  TKDE 2012»
    Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
    11 years 11 months ago
    Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
    Download  www.comp.hkbu.edu.hk
    —The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
    Hong Zeng, Yiu-ming Cheung
    claim paper
    Read More »
    AIA
    2006
    124views Artificial Intelligence» more  AIA 2006»
    Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT
    13 years 10 months ago
    Speeding Up Model-based Diagnosis by a Heuristic Approach to Solving SAT
    Download  www.uni-weimar.de
    Model-based diagnosis of technical systems requires both a simulation machinery and a logic calculus. The former is responsible for the system's behavior analysis, the latter...
    Benno Stein, Oliver Niggemann, Theodor Lettmann
    claim paper
    Read More »
    IJCAI
    1993
    100views Artificial Intelligence» more  IJCAI 1993»
    Genetic State-Space Search for Constrained Optimization Problems
    13 years 10 months ago
    Genetic State-Space Search for Constrained Optimization Problems
    Download  ijcai.org
    This paper introduces GSSS (Genetic State-Space Search). The integration of two general search paradigms — genetic search and state-space-search provides a general framework whi...
    Jan Paredis
    claim paper
    Read More »
    SIAMDM
    2008
    90views more  SIAMDM 2008»
    Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
    13 years 8 months ago
    Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
    Download  www.mathstat.concordia.ca
    Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
    Andrei A. Krokhin, Benoit Larose
    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-2024, USA.