Sciweavers

    2864 search results - page 348 / 573
    » Constraint Programming in OPL
    Sort
    View
    CASCON
    2004
    108views Education» more  CASCON 2004»
    Consistent query answering under inclusion dependencies
    13 years 10 months ago
    Consistent query answering under inclusion dependencies
    Download  homepages.inf.ed.ac.uk
    For several reasons a database may not satisfy certain integrity constraints (ICs), for example, when it is the result of integrating several independent data sources. However, mo...
    Loreto Bravo, Leopoldo E. Bertossi
    claim paper
    Read More »
    FLAIRS
    2006
    108views Artificial Intelligence» more  FLAIRS 2006»
    An Idiomatic Plucked String Player
    13 years 10 months ago
    An Idiomatic Plucked String Player
    Download  cmr.soc.plymouth.ac.uk
    We are developing systems which play music on synthesized plucked strings instruments idiomatically. The present paper introduces a system focusing on the acoustic guitar. The sys...
    Leandro Lesqueves Costalonga, Eduardo Reck Miranda...
    claim paper
    Read More »
    AAAI
    1994
    100views Intelligent Agents» more  AAAI 1994»
    Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
    13 years 10 months ago
    Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
    Download  www.aaai.org
    We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
    Steven Minton, Ian Underwood
    claim paper
    Read More »
    WCET
    2007
    110views Software Engineering» more  WCET 2007»
    WCET Analysis: The Annotation Language Challenge
    13 years 10 months ago
    WCET Analysis: The Annotation Language Challenge
    Download  www.vmars.tuwien.ac.at
    Worst-case execution time (WCET) analysis is indispensable for the successful design and development of systems, which, in addition to their functional constraints, have to satisf...
    Raimund Kirner, Jens Knoop, Adrian Prantl, Markus ...
    claim paper
    Read More »
    ANOR
    2008
    171views more  ANOR 2008»
    A branch and bound method for the job-shop problem with sequence-dependent setup times
    13 years 9 months ago
    A branch and bound method for the job-shop problem with sequence-dependent setup times
    Download  hal.archives-ouvertes.fr
    This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
    Christian Artigues, Dominique Feillet
    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.