Sciweavers

    260 search results - page 5 / 52
    » Efficient Computation of Optimal Trading Strategies
    Sort
    View
    EUROPAR
    2007
    Springer
    122views Distributed And Parallel Com...» more  EUROPAR 2007»
    Domain-Specific Optimization Strategy for Skeleton Programs
    13 years 11 months ago
    Domain-Specific Optimization Strategy for Skeleton Programs
    Download  research.nii.ac.jp
    Skeletal parallel programming enables us to develop parallel programs easily by composing ready-made components called skeletons. However, a simplycomposed skeleton program often l...
    Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...
    claim paper
    Read More »
    ACCV
    2009
    Springer
    286views Computer Vision» more  ACCV 2009»
    Accurate and Efficient Cost Aggregation Strategy for Stereo Correspondence Based on Approximated Joint Bilateral Filtering
    13 years 11 months ago
    Accurate and Efficient Cost Aggregation Strategy for Stereo Correspondence Based on Approximated Joint Bilateral Filtering
    Download  www.vision.deis.unibo.it
    Recent local state-of-the-art stereo algorithms based on variable cost aggregation strategies allow for inferring disparity maps comparable to those yielded by algorithms based on ...
    Stefano Mattoccia, Simone Giardino, Andrea Gambini
    claim paper
    Read More »
    CISIM
    2008
    IEEE
    192views Information Technology» more  CISIM 2008»
    Tuning Struggle Strategy in Genetic Algorithms for Scheduling in Computational Grids
    14 years 2 months ago
    Tuning Struggle Strategy in Genetic Algorithms for Scheduling in Computational Grids
    Download  www.softcomputing.net
    Job Scheduling on Computational Grids is gaining importance due to the need for efficient large-scale Grid-enabled applications. Among different optimization techniques addressed ...
    Fatos Xhafa, Bernat Duran, Ajith Abraham, Keshav P...
    claim paper
    Read More »
    AAAI
    2008
    154views Intelligent Agents» more  AAAI 2008»
    An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
    13 years 10 months ago
    An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
    Download  groups.csail.mit.edu
    When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
    Masahiro Ono, Brian C. Williams
    claim paper
    Read More »
    NAACL
    2010
    136views Computational Linguistics» more  NAACL 2010»
    Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
    13 years 5 months ago
    Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
    Download  www.cs.rochester.edu
    Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
    Daniel Gildea
    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.