Sciweavers

    141 search results - page 15 / 29
    » Bounding basis reduction properties
    Sort
    View
    SEFM
    2009
    IEEE
    149views Software Engineering» more  SEFM 2009»
    Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths
    14 years 4 months ago
    Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths
    Download  perseo.dif.um.es
    Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...
    Davide Bresolin, Valentin Goranko, Angelo Montanar...
    claim paper
    Read More »
    ICC
    2007
    IEEE
    147views Communications» more  ICC 2007»
    MIMO OFDM Frequency Offset Estimator with Low Computational Complexity
    14 years 4 months ago
    MIMO OFDM Frequency Offset Estimator with Low Computational Complexity
    Download  www.prism.uvsq.fr
    — This paper addresses a low complexity frequency offset estimator for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems over freque...
    Yanxiang Jiang, Xiaohu You, Xiqi Gao, Hlaing Minn
    claim paper
    Read More »
    MP
    2006
    75views more  MP 2006»
    A Class of stochastic programs with decision dependent uncertainty
    13 years 9 months ago
    A Class of stochastic programs with decision dependent uncertainty
    Download  egon.cheme.cmu.edu
    We address a class of problems where decisions have to be optimized over a time horizon given that the future is uncertain and that the optimization decisions influence the time o...
    Vikas Goel, Ignacio E. Grossmann
    claim paper
    Read More »
    KI
    2006
    Springer
    145views Artificial Intelligence» more  KI 2006»
    A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
    13 years 9 months ago
    A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
    Download  www.informatik.uni-bremen.de
    Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
    Rüdiger Ebendt, Rolf Drechsler
    claim paper
    Read More »
    LMCS
    2007
    132views more  LMCS 2007»
    The Complexity of Model Checking Higher-Order Fixpoint Logic
    13 years 9 months ago
    The Complexity of Model Checking Higher-Order Fixpoint Logic
    Download  www2.tcs.ifi.lmu.de
    Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
    Roland Axelsson, Martin Lange, Rafal Somla
    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.