Sciweavers

    285 search results - page 38 / 57
    » The complexity of soft constraint satisfaction
    Sort
    View
    SARA
    2009
    Springer
    211views Artificial Intelligence» more  SARA 2009»
    Common Subexpressions in Constraint Models of Planning Problems
    15 years 6 months ago
    Common Subexpressions in Constraint Models of Planning Problems
    Download  www.cs.st-andrews.ac.uk
    Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
    Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
    claim paper
    Read More »
    PUK
    2001
    166views Computer Science» more  PUK 2001»
    Realizing a Global Hyperpolyhedron Constraint via LP Techniques
    15 years 1 months ago
    Realizing a Global Hyperpolyhedron Constraint via LP Techniques
    Download  www-is.informatik.uni-oldenburg.de
    Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...
    Miguel A. Salido, Adriana Giret, Federico Barber
    claim paper
    Read More »
    AI
    2008
    Springer
    92views Artificial Intelligence» more  AI 2008»
    Domain filtering consistencies for non-binary constraints
    14 years 12 months ago
    Domain filtering consistencies for non-binary constraints
    Download  www.lirmm.fr
    In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
    Christian Bessiere, Kostas Stergiou, Toby Walsh
    claim paper
    Read More »
    TCS
    2008
    98views Theoretical Computer Science» more  TCS 2008»
    On temporal logic constraint solving for analyzing numerical data time series
    14 years 11 months ago
    On temporal logic constraint solving for analyzing numerical data time series
    Download  pauillac.inria.fr
    Temporal logics and model-checking have proved successful to respectively express biological properties of complex biochemical systems, and automatically verify their satisfaction...
    François Fages, Aurélien Rizk
    claim paper
    Read More »
    IVC
    2006
    227views more  IVC 2006»
    Automatic registration of overlapping 3D point clouds using closest points
    14 years 11 months ago
    Automatic registration of overlapping 3D point clouds using closest points
    Download  users.aber.ac.uk
    While the SoftAssign algorithm imposes a two-way constraint embedded into the deterministic annealing scheme and the EMICP algorithm imposes a one-way constraint, they represent t...
    Yonghuai Liu
    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.