Sciweavers

    16091 search results - page 69 / 3219
    » Solving
    Sort
    View
    IJCAI
    2003
    116views Artificial Intelligence» more  IJCAI 2003»
    Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
    13 years 9 months ago
    Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
    Download  www.lirmm.fr
    We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
    Christian Bessière, Anaïs Fabre, Ulric...
    claim paper
    Read More »
    METMBS
    2003
    138views Mathematics» more  METMBS 2003»
    A Stochastic Method for Solving Inverse Problems in Epidemic Modelling
    13 years 9 months ago
    A Stochastic Method for Solving Inverse Problems in Epidemic Modelling
    Download  cg.cs.uni-bonn.de
    — We describe a stochastic optimization method that can be used to solve inverse problems in epidemic modelling. Although in general it cannot be expected that these inverse prob...
    Dominik Novotni, Andreas Weber 0004
    claim paper
    Read More »
    FLAIRS
    1998
    74views Artificial Intelligence» more  FLAIRS 1998»
    Discovering Heuristic Strategy for Solving Scheduling Problems
    13 years 9 months ago
    Discovering Heuristic Strategy for Solving Scheduling Problems
    Download  www.aaai.org
    Optimallysolving a scheduling problemis computationally intractable, hencevarieties of techniques and methodshave been explored to obtain sub-optimal solutions to such problems. I...
    Rasiah Loganantharaj
    claim paper
    Read More »
    PDPTA
    1996
    197views Distributed And Parallel Com...» more  PDPTA 1996»
    Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network
    13 years 9 months ago
    Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network
    Download  www.cs.kent.edu
    This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
    Darrell R. Ulm, Johnnie W. Baker
    claim paper
    Read More »
    CSC
    2009
    109views Applied Computing» more  CSC 2009»
    A New Iterative Method for Solving Initial Value Problems
    13 years 8 months ago
    A New Iterative Method for Solving Initial Value Problems
    Download  www.uwstout.edu
    - In this paper, we introduce a new parameter iteration method (P-Iteration for short) which can be applied on Adams-Moulton methods to solve initial value problems. Compared with ...
    Mingshen Wu, Weihu Hong
    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.